6.006 | Fall 2011 | Undergraduate

Introduction to Algorithms

Lecture Videos

Lecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack

Description: This lecture starts with how to define useful subproblems for strings or sequences, and then looks at parenthesization, edit distance, and the knapsack problem. The lecture ends with a brief discussion of pseudopolynomial time.

Instructor: Erik Demaine

Course Info

Learning Resource Types
Lecture Videos
Recitation Videos
Problem Sets with Solutions
Exams with Solutions
Programming Assignments with Examples
Lecture Notes