Algorithmic Problems in Python - UUDDEEMMYY

seeders: 0
leechers: 11
Added on November 24, 2015 by viru338in Other > Tutorials
Torrent verified.



Algorithmic Problems in Python - UUDDEEMMYY (Size: 623.71 MB)
 001 Introduction.mp43.87 MB
 002 Complexity theory introduction.jpeg205.96 KB
 002 Complexity theory introduction.mp456.22 MB
 001 Backtracking introduction.mp413.74 MB
 002 N-queens problem introduction.mp423.87 MB
 003 N-queens problem implementation.mp415.46 MB
 004 Hamiltonian cycle introduction.mp446.63 MB
 005 Hamiltonian problem - NP-hard problems.mp419.56 MB
 006 Hamiltonian cycle implementation.mp429.42 MB
 007 Coloring problem introduction.mp442.08 MB
 008 Coloring problem implementation.mp427.46 MB
 009 Knight tour introduction.mp412.27 MB
 010 Knight tour implementation.mp410.36 MB
 001 Dynamic programming introduction.mp410.59 MB
 002 Fibonacci numbers introduction.mp417.16 MB
 003 Fibonacci numbers implementation.mp415.37 MB
 004 Coin change problem introduction.mp453.13 MB
 005 Coin change problem implementation.mp420.24 MB
 006 Rod cutting problem introduction.mp448.59 MB
 007 Rod cutting problem implementation.mp412.77 MB
 008 Knapsack problem introduction.mp428.89 MB
 009 Knapsack problem example.mp454.29 MB
 010 Knapsack problem implementation.mp429.36 MB
 001 Source code.html1.21 KB


Description

Thanks to Rocky_4560.25K



Algorithmic Problems in Python

MP4 | Video: 1280x720 | 55 kbps | 44 KHz | Duration: 3 Hours | 623 MB
Genre: eLearning | Language: English


Learn the basic algorithmic methodologies from backtracking to dynamic programming



This course is about the fundamental concepts of algorithmic problems, focusing on backtracking and dynamic programming. As far as I am concerned these techniques are very important nowadays, algorithms can be used (and have several applications) in several fields from software engineering to investment banking or research&development.

In each section we will talk about the theoretical background for all of these algorithms then we are going to implement these problems together.

The first chapter is about backtracking: we will talk about problems such as N-queens problem or hamiltonian cycles and coloring problem. In the second chapter we will talk about dynamic programming, theory first then the concrete examples one by one: fibonacci sequence problem and knapsack problem.

Keep Seeding :)

Sharing Widget


Download torrent
623.71 MB
seeders:0
leechers:11
Algorithmic Problems in Python - UUDDEEMMYY