videos

• pre lecture 0 video
• pre lecture 1 video
• pre lecture 2 video

Slides

• pre lecture 0 slides
• lecture 0 slides
• pre lecture 1 slides
• lecture 1 slides
• pre lecture 2 slides
• lecture 2 slides

Demos

topological sort

topsort.py

shortest path in a DAG

shortest.py

Longest common subsequences

• memoized
• table driven

Longest increasing subsequence

• paths ending at i

Edit distance

• edit-dist.py

Reading

• Dynamic programming :: DPV 6, CLRS 14
• Topological Sort :: CLRS 20.4, DPV 3.3
• Shortest path in DAG :: DPV 6.1., CLRS 22.2