| WEEK |
DAY |
ANNOUNCEMENTS |
TOPIC & READING |
LABS |
| 1 | Sep 04 | | Course introduction
Stable matching
read: chapter 1 | set up github
Lab 1
Hw 1 |
Sep 06 | |
Sep 08 | |
| 2 | Sep 11 | | Analysis
read: chapter 2.1-2.4 | Lab 2
Hw 2 |
Sep 13 | |
Sep 15 | Drop/add ends |
| 3 | Sep 18 | | Lab 3
Hw 3 |
Sep 20 | | Graph algorithms
read: chapter 3 |
Sep 22 | |
| 4 | Sep 25 | | Lab 4
Hw 4 |
Sep 27 | |
Sep 29 | |
| 5 | Oct 02 | | Greedy algorithms
read: chapter 4 | Lab 5
Hw 5 |
Oct 04 | |
Oct 06 | |
| 6 | Oct 09 | | Lab 6 |
Oct 11 | | Divide and conquer
read: chapter 5 |
Oct 13 | |
| | Oct 16 | Fall break |
Oct 18 |
Oct 20 |
| 7 | Oct 23 | | Divide and conquer
read: chapter 5 (continued) | Lab 7
Hw 6 |
Oct 25 | midterm 7-10pm (SCI 199)
midterm review | Dynamic programming
read: chapter 6 |
Oct 27 | |
| 8 | Oct 30 | | Lab 8
Hw 7 |
Nov 01 | | Intractability
read: chapter 8.1-8.4; see also CLRS chapter 34 |
Nov 03 | |
| 9 | Nov 06 | | Lab 9
Hw 8 |
Nov 08 | |
Nov 10 | CR/NC/W Deadline |
| 10 | Nov 13 | | Network flow
read: chapter 7.1-7.3, 7.5, 7.9; see also CLRS chapter 26 | Lab 10
Hw 9 |
Nov 15 | |
Nov 17 | |
| 11 | Nov 20 | | Linear programming & the simplex algorithm
read: note on LPs and duality
Approximation algorithms |
|
Nov 22 | | Approximation algorithms
read: chapter 11.1-11.4, 11.6, 11.8; see also CLRS chapter 35 |
Nov 24 | Thanksgiving break |
| 12 | Nov 27 | | Approximation algorithms
read: chapter 11.1-11.4, 11.6, 11.8; see also CLRS chapter 35 (continued) | Lab 11
(see repo for hw & partner) |
Nov 29 | |
Dec 01 | | Randomized algorithms
read: chapter 13.1-13.5 |
| 13 | Dec 04 | | Lab 12
(see repo for hw) |
Dec 06 | |
Dec 08 | | Local search
read: chapter 12.1, 12.2, 12.4, 12.5 |
| 14 | Dec 11 | Last day of classes (Dec 12) | final review |
Dec 17 | Final Exam, 9am-noon in SCI 199 (see the full schedule here) |