Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths

Course Info

Instructors

Departments

Electrical Engineering and Computer Science

As Taught In

Fall 2011

Level

Undergraduate

Topics

Engineering
- Computer Science
  - Algorithms and Data Structures

Learning Resource Types

Lecture Videos

Recitation Videos

Problem Sets with Solutions

Exams with Solutions

Programming Assignments with Examples

Lecture Notes

Download Course

Lecture Videos

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