| Slides from each lecture will be posted on this page as the course progresses. | ||||||
| Week | Topic | SEC 5101/5201 | SEC 5301 | Reading |
||
|---|---|---|---|---|---|---|
| Teacher | Slides | Teacher | Slides | |||
| 1 | Course introduction; Divide & Conquer | Singh | Infosheet, Slides | Shah | Infosheet, Slides | CLRS Ch 4, DPV Ch 2, KT Ch 5 |
| 2 | Greedy Algorithms | Singh | Slides | Shah | Slides | CLRS Ch 16, DPV Ch 5, KT 4 |
| 3 | Dynamic Programming | Singh | Slides | Shah | Slides | CLRS Ch 15, DPV Ch 6, KT Ch 6 |
| 4 | Dynamic Programming Ends; Network Flow Starts | Shah (Guest Lecture) | Slides | Shah | Slides | CLRS Ch 26, DPV Ch 7(7.1-7.3), KT Ch 7 |
| 5 | Network Flow Applications | Singh | Slides | Shah | Slides | Same as above |
| 6 | Linear Programming | Singh | Slides | Shah | Slides | CLRS Ch 29, DPV Ch 7 |
| 7,8 | Complexity | Singh | Slides | Shah | Slides | CLRS Ch 34, DPV Ch 8, KT Ch 8 |
| Week of Nov 4 | NO CLASS (READING WEEK) | -- | -- | -- | -- | -- |
| 9,10 | Approximation Algorithms & Local Search | Singh | Slides | Shah | Slides | CLRS Ch 35, DPV Ch 9, KT 11 |
| 11 | Randomized Algorithms | Singh | Slides | Shah | Slides | CLRS Ch 5, DPV Ch 1, KT Ch 13 |
| 12 | Review + Fun Asides | Singh | -- | Shah | Review Fun Asides (NOT IN SYLLABUS) |
-- |
