MP4 | Video: h264, 1280×720 | Audio: AAC, 44.1 KHz, 2 Ch
Genre: eLearning | Language: English + .srt | Duration: 41 lectures (4h 5m) | Size: 802 MB
Learn recursion, backtracking (n-queens problem etc.) and dynamic programming (knapsack problem etc.) What you’ll learn:
Understand backtracking
Understand dynamic programming
Solve problems from scratch
Implement feedforward neural networks from scratch
Requirements
Basic Python
Description
This course is about the fundamental concepts of algorithmic problems, focusing on recursion, 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 R&D.
Section 1:
what is recursion
stack memory and recursion
factorial numbers problem
Fibonacci numbers
towers of Hanoi problem
recursion vs iteration
Section 2:
what is backtracking
n-queens problem
Hamiltonian cycle problem
knight’s tour problem
coloring problem
NP-complete problems
Reviews
There are no reviews yet.