## Lecture 15: Dynamic Programming, Longest Common Subsequence

author: Charles E. Leiserson, Department of Brain and Cognitive Sciences, Massachusetts Institute of Technology, MIT
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009,   recorded: November 2005,   views: 16646
released under terms of: CC BY-NC-SA
You might be experiencing some problems with Your Video player.

# Slides

0:00 Slides Introduction to Algorithms - Lecture 15 Dynamic programming (1) Dynamic programming (2) Dynamic programming (3) Dynamic programming (4) Brute-force LCS algorithm (1) Brute-force LCS algorithm (2) Towards a better algorithm (1) Towards a better algorithm (2) Towards a better algorithm (3) Recursive formulation (1) Recursive formulation (2) Recursive formulation (3) Recursive formulation (4) Recursive formulation (5) Dynamic-programming hallmark #1 (1) Dynamic-programming hallmark #1 (2) Recursive algorithm for LCS (1) Recursive algorithm for LCS (2) Recursion tree (1) Recursion tree (2) Recursion tree (3) Dynamic-programming hallmark #2 (1) Dynamic-programming hallmark #2 (2) Memoization algorithm (1) Memoization algorithm (2) Memoization algorithm (3) Dynamic-programming algorithm (1) Dynamic-programming algorithm (2) Dynamic-programming algorithm (3) Dynamic-programming algorithm (4)

# Report a problem or upload files

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

# Description

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

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

1 raj kishor nanada, September 7, 2009 at 11:08 a.m.:

good for me thanks to .....provider

2 Sunil kumar maurya, October 6, 2009 at 6:19 p.m.:

These video lectures are amazing. really it enhance my concept to analysis and design of algorithm.

3 polisetti, June 10, 2010 at 5:01 a.m.:

2 gud mahn...

4 Phil Boswell, January 27, 2011 at 3:38 p.m.:

The sound level on this one seems to be very much lower than on others in this sequence. I note similar comments on YouTube. Is there anything can be done about this problem?

5 Ozgur, June 13, 2011 at 1:18 p.m.:

ProgrammingPages.net - http://www.programmingpages.net
Best Programming Resources and Source Code Examples for Java, Php, Visual Basic, C++ ,Asp, Python, Javascript, Ada, Cobol ,C, C#, Delphi, Fortran, Logo, Ruby, Xml.
Programming E-Book, Video Tutorials, History, Algorithms and Faqs.

6 Asif, August 4, 2012 at 1:37 a.m.:

this is really a good way to get understand who are student of mcs and i.t level also i need your help to know the way of algorithm how it is created in a easy way as well as need to know about sequence ,controll and repeatation structures thank , i am really needy of your help
thank you.

7 minmin, October 24, 2012 at 3:12 p.m.:

if you are using windows , go to volume bar near the clock. Select, playback devices, click on speaker or mic, and select the properties . go to enhancement, select loudness enhancement.

8 jalpesh, December 7, 2012 at 6:58 a.m.:

hi!!!!!!

first of all thanx a lot for help.... sir

please i want shortest common supersequence problem using dynamic programming example for my master's work in Computer engineering so please provide appropriate materials..