| Lecture |
Date |
Topic |
Reading |
PDF Slides |
Inked |
| Lecture 1 | Mon, Jan 6 | Introductions |
KT, Sec 1.1 |
PDF |
HTML |
| Lecture 2 | Wed, Jan 8 | Stable matching |
KT, Sec 1.1 and 1.3 |
PDF |
HTML |
| Lecture 3 | Fri, Jan 10 | Asymptotic analysis |
KT, Sec 2.1-2.4 |
PDF |
HTML |
| Lecture 4 | Mon, Jan 13 | Graphs and graph traversal |
KT, Sec 3.1-3.2 |
PDF |
guest |
| Lecture 5 | Wed, Jan 15 |
Graphs and graph traversal II |
KT, Sec 3.1-3.2 |
PDF |
power failure |
| Lecture 6 | Fri, Jan 17 |
Directed graphs and topological sorting |
KT, Sec 3.3-3.6 |
PDF |
HTML |
| Lecture 7 | Wed, Jan 21 |
Greedy algorithms: Scheduling |
KT, Sec 4.1-4.4 |
PDF |
HTML |
| Lecture 8 | Fri, Jan 24 |
Greedy algorithms: Scheduling II |
KT, Sec 4.1-4.3, 4.5 |
PDF |
HTML |
| Lecture 9 | Mon, Jan 27 |
Minimum spanning trees and shortest paths |
KT, Sec 4.4-4.7 |
PDF |
HTML |
| Lecture 10 | Wed, Jan 29 |
Dijkstra's algorithm / Divide & conquer
| KT, Sec 5.1-5.4 |
PDF |
HTML |
| Lecture 11 | Fri, Jan 31 |
Divide & conquer
| KT, Sec 5.1-5.4 |
PDF |
old school |
| Lecture 12 | Mon, Feb 3 |
The Master theorem & multiplication
| KT, Sec 5.5-5.6 |
PDF |
HTML |