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
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