Scribd
Upload
13 views21 pages

Dynamic Programming

The document discusses a lecture on dynamic programming which covers what dynamic programming is, how to use it, and examples like the longest common subsequence problem and traveling salesman problem. The notes are handwritten and intended to supplement the actual lectures.

Uploaded by

Prabhav Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views21 pages

Dynamic Programming

The document discusses a lecture on dynamic programming which covers what dynamic programming is, how to use it, and examples like the longest common subsequence problem and traveling salesman problem. The notes are handwritten and intended to supplement the actual lectures.

Uploaded by

Prabhav Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

COMPSCI 330: Algorithms Fall 2012

Duke University Instructor: Chittu Tripathy

Lecture: Dynamic Programming

 Dynamic Programming
— What is it? How to use it?
— Longest Common Subsequence (LCS)
— The Traveling Salesman Problem (TSP)
— 0-1-Knapsack

These notes are hand-written, unedited and sketchy. They are primarily used for, and based on
my lectures.

If you find any bug, impreciseness, or a rare poor-/mis-interpretation of facts, please let me
know. I will be grateful for any additional comments you have that are intended to make the
quality of the notes better.

Please note that I will provide my hand-written lecture notes only for a subset of my lectures,
not for all lectures. Therefore, it is your responsibility to attend all the lectures, take notes
regularly, and ask me and/or the TAs if you have any questions.

Thank you!
--Chittu

Written using an Intuos 5 Touch Pen Tablet and Microsoft Office OneNote

You might also like