Lecture 15: Dynamic Programming, Longest Common Subsequence
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: November 2005, views: 19603
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
"So, the topic today is dynamic programming. The term programming in the name of this term doesn't refer to computer programming. OK, programming is an old word that means any tabular method for accomplishing something. So, you'll hear about linear programming and dynamic programming. Either of those, even though we now incorporate those algorithms in computer programs, originally computer programming, you were given a datasheet and you put one line per line of code as a tabular method for giving the machine instructions as to what to do..."
Download slides: mit6046jf05_leiserson_lec15_01.pdf (246.3 KB)
Download mit6046jf05_leiserson_lec15_01.m4v (Video - generic video source 147.5 MB)
Download mit6046jf05_leiserson_lec15_01.rm (Video - generic video source 113.6 MB)
Download mit6046jf05_leiserson_lec15_01.flv (Video 201.9 MB)
Download mit6046jf05_leiserson_lec15_01.wmv (Video 619.0 MB)
Download mit6046jf05_leiserson_lec15_01.mp3 (Audio lecture 16.4 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !