Скачать или смотреть Algorithms: DAA (IISc): Lec4 (part B). Elements of Dynamic Programming (Memoization/Iterative DP)

This graduate-level algorithms course is taught at the Indian Institute of Science (IISc) by Arindam Khan. This video discusses Elements of DP -- optimal substructure, overlapping and independent subproblems and other properties. Also, a comparison of top-down (memorization) and bottom-up (iterative) approaches.


#CS #Algorithms #Computer #Science #Computing #IISc #CSA #GATE #India #ArindamKhan #DP #DynamicProgramming #History #Memoization #Iterative #Recursion #fibonacci

Fun element: The Lord of the Rings!
---
Chapters
00:00 Recap
00:25 Fibonacci Number and Exponential-sized Recursion Tree
2:54 Top-down and Bottom-up approaches (and Lord of the Rings)
6:38 Elements of DP (optimal substructure)
8:38 Memoization vs Iteration
10:28 Overlapping but independent subproblems
12:30 Story of Bellman and DP
14:10 References
-----
Resource:
[1] Jeff Erickson's Chapter on DP: https://jeffe.cs.illinois.edu/teachin...