Video recordings of the lectures are available on canvas.
Date | Description |
---|---|
January 3 |
Course Overview & Greedy Algorithms Slides |
January 5 |
Binary Search (part 1) Slides |
January 8 |
Binary Search (part 2) Slides |
January 10 |
Binary Search (part 3) Slides |
January 12 |
Divide & Conquer (part 1) Slides |
January 17 |
Divide & Conquer (part 2) Slides |
January 19 |
Divide & Conquer (part 3) Slides |
January 22 |
Divide & Conquer (part 4) Slides |
January 24 |
Divide & Conquer (part 5) Slides |
January 26 |
Dynamic Programming (part 1) Slides and Robot in Excel |
January 29 |
Dynamic Programming (part 2) Slides |
January 31 |
Dynamic Programming (part 3) Slides |
February 2 |
Dynamic Programming (part 4) Slides and Optimal BST in Excel |
February 5 |
Dynamic Programming (part 5) Slides |
February 7 |
Dynamic Programming (part 6) Slides |
February 9 |
Network Flows (part 1) Slides |
February 12 |
Network Flows (part 2) Slides |
February 14 |
Network Flows (part 3) Slides |
February 16 |
Network Flows (part 4) Slides |
February 21 |
Network Flows (part 5) Slides |
February 23 |
NP Completeness Slides |
February 26 |
Coping with NP Completeness: Special Cases & Rounding Slides |
February 28 |
Coping with NP Completeness: "Fast Enough" Exponential Time Slides |
March 2 |
Coping with NP Completeness: Branch & Bound Slides |
March 5 |
Coping with NP Completeness: Advanced Techniques Slides |
March 7 |
More Dynamic Programming Slides |
March 9 |
Review Slides |