Lecture Videos
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths
Description: This lecture introduces dynamic programming, in which careful exhaustive search can be used to design polynomial-time algorithms. The Fibonacci and shortest paths problems are used to introduce guessing, memoization, and reusing solutions to subproblems.
Instructor: Erik Demaine
Transcript
| Instructors: | |
| Course Number: |
|
| Departments: | |
| As Taught In: | Fall 2011 |
| Level: |
Undergraduate
|
Learning Resource Types
theaters
Lecture Videos
theaters
Recitation Videos
assignment_turned_in
Problem Sets with Solutions
grading
Exams with Solutions
assignment_turned_in
Programming Assignments with Examples
notes
Lecture Notes