Home » Courses » Electrical Engineering and Computer Science » Introduction to Algorithms » Lecture Videos » Lecture 21: DP III: Parenthesization, Edit Distance, Knapsack

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

Flash and JavaScript are required for this feature.

Download the video from iTunes U or the Internet Archive.

About this Video
Playlist
Lecture Notes
Download this Video

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

MIT OpenCourseWare makes the materials used in the teaching of almost all of MIT's subjects available on the Web, free of charge. With more than 2,000 courses available, OCW is delivering on the promise of open sharing of knowledge.

© 2001–2012
Massachusetts Institute of Technology

Your use of the MIT OpenCourseWare site and materials is subject to our Creative Commons License and other terms of use.