Lecture Slides
CMSC 641

Spring Semester 2003

Dynamic Programming Wednesday, 5 February 2003
Greedy Algorithms Wednesday, 12 February 2003
Amortized Analysis Wednesday, 12 February 2003
B-Trees Tuesday, 15 April 2003
Binomial Heaps Tuesday, 15 April 2003
Fibonacci Heaps Tuesday, 15 April 2003
Data Structures for Disjoint Sets Tuesday, 15 April 2003
Elementary Graph Algorithms Tuesday, 15 April 2003
Minimum Spanning Trees Tuesday, 15 April 2003
Single Source Shortest Paths Tuesday, 15 April 2003
All Pairs Shortest Paths Tuesday, 15 April 2003
Maximum Flow Tuesday, 15 April 2003
Dasgupta Slides on NP Completeness Tuesday, 29 April 2003
Dasgupta Review Slides Tuesday, 29 April 2003

Last Modified: 11 February 2003