| Slides from each lecture will be posted on this page as the course progresses. | |||||
| Week | Topic | Slides | Recordings (S = Stream, M = MyMedia) | Reading |
|
|---|---|---|---|---|---|
| LEC 0101 (Tue 1-3, Thu 2-3) | LEC 0201 (Tue 3-4, Thu 3-5) | ||||
| 1 | Course introduction; Divide & Conquer | Slides | Lecture 1 (S | M) Lecture 2 (S | M) |
Lecture 1 (S | M) Lecture 2 (S | M) |
CLRS Ch 4, DPV Ch 2, KT Ch 5 |
| 2,3 | Greedy Algorithms | Slides | Lecture 3 (S | M) Lecture 4 (S | M) Lecture 5 (S | M) Lecture 6 (S | M) |
Lecture 3 (S | M) Lecture 4 (S | M) Lecture 5 (S | M) Lecture 6 (S | M) |
CLRS Ch 16, DPV Ch 5, KT 4 |
| 4 | Dynamic Programming | Slides | Lecture 7 (S | M) Lecture 8 (S | M) |
Lecture 7, Part 1 (S | M) Lecture 7, Part 2 (S | M) Lecture 8 (S | M) |
CLRS Ch 15, DPV Ch 6, KT Ch 6 |
| 5 | Dynamic Programming Ends; Network Flow Starts | Slides | Lecture 9 (S | M) Lecture 10 (S | M) |
Lecture 9 (S | M) Lecture 10 (S | M) |
CLRS Ch 26, DPV Ch 7(7.1-7.3), KT Ch 7 |
| 6 | Network Flow Applications | Slides | Lecture 11 (S | M) Lecture 12 (S | M) |
Lecture 11 (S | M) Lecture 12 (S | M) |
Same as above |
| 7 | Linear Programming | Slides | Lecture 13 (S | M) Lecture 14 (S | M) |
Lecture 13 (S | M) Lecture 14 (S | M) |
CLRS Ch 29, DPV Ch 7 |
| 8,9 | Complexity | Slides | Lecture 15 (S | M) Lecture 16 (S | M) Lecture 17 (S | M) Lecture 18 (S | M) |
Lecture 15 (S | M) Lecture 16 (S | M) Lecture 17 (S | M) Lecture 18 (S | M) |
CLRS Ch 34, DPV Ch 8, KT Ch 8 |
| Week of Nov 8 | NO CLASSES (READING WEEK) | -- | -- | -- | -- |
| 10,11 | Approximation Algorithms | Slides | Lecture 19 (S | M) Lecture 20 (S | M) Lecture 21 (S | M) |
Lecture 19 (S | M) Lecture 20 (S | M) Lecture 21 (S | M) |
CLRS Ch 35, DPV Ch 9, KT 11 |
| Nov 25 & 30 | Embedded Ethics Module | Slides, Webpage | No recording | No recording | Philosophy video, CS video |
| 12 | Randomized Algorithms & Review | Slides Review Slides |
Lecture 22 (S | M) Lecture 23 (S | M) |
Lecture 22 (S | M) Lecture 23 (S | M) |
CLRS Ch 5, DPV Ch 1, KT Ch 13 |
