Lecture Videos
Lecture 15: Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling
This is the first of four lectures on dynamic programing. This begins with how to solve a problem recursively and continues with three examples: Fibonacci, DAG shortest paths, and bowling.
Instructor: Erik Demaine
Course Info
Instructors
Departments
As Taught In
Spring
2020
Level
Topics
Learning Resource Types
theaters
Lecture Videos
grading
Exams with Solutions
notes
Lecture Notes
assignment
Problem Sets
Problem Set Solutions
