problem
is
Recursion
recursion
problems
about
in
In
Problems
the
• What you'll learn Understand backtracking Understand dynamic programming Solve problems from scratch Implement feedforward neural networks from scratch Course content Expand all 40 lectures04:04:05 +Introductio +Recursion +Search Algorithms +Backtracking +Dynamic Programming +Course Materials (DOWNLOADS) +DISCOUNT FOR OTHER COURSES!
• 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 Section 3: what is dynamic programming Fibonacci numbers knapsack problem coin change problem rod cutting problem In each section we will talk about the theoretical background for all of these algorithms then we are going to implement these problems one by one.
• The first chapter is about recursion.