|
|
|
|
|
Lecture Slides
| Date |
Title |
Reading |
PDF Slides |
PDF Handouts |
PPTX |
Annotated PDF |
| Monday, January 7, 2013 |
1: Course Introduction, Stable Matching |
1.1 and 1.2 |
PDF |
PDF |
PPTX |
PDF |
| Monday, January 14, 2013 |
2: Graph Algorithms |
2.1, 2.2, 3.1-3.6 |
PDF |
PDF |
PPTX |
PDF |
| Thursday, January 17, 2013 |
3: Makeup lecture: Greedy Algorithms |
4.1, 4.2, 4.4 |
PDF |
PDF |
PPTX |
PDF, Whiteboard PDF |
| Monday, January 21, 2013 |
Martin Luther King holiday, no class |
|
|
|
|
|
| Monday, January 28, 2013 |
4: Minimum Spanning Trees, Recurrences |
4.5, 4.7, 4.8, 5.1, 5.2 |
PDF |
PDF |
PPTX |
PDF, Whiteboard PDF |
| Monday, February 4, 2013 |
5: Divide and Conquer (Guest lecturer, Larry Ruzzo) |
5.3-5.5 |
PDF |
PDF |
PPTX |
PDF |
| Monday, February 11, 2013 |
6: Dynamic programming (+ midterm) |
6.1-6.4 |
PDF |
PDF |
PPTX |
PDF |
| Tuesday, February 19, 2013 |
7: Dynamic programming |
6.1-6.10 |
PDF |
PDF |
PPTX |
PDF, Whiteboard PDF |
| Monday, February 25, 2013 |
8: Network Flow |
6.8, 7.1, 7.2 |
PDF |
PDF |
PPTX |
PDF |
| Monday, March 4, 2013 |
9: Network Flow Applications |
7.5-7.12 |
PDF |
PDF |
PPTX |
PDF |
| Monday, March 11, 2013 |
10: NP-Completeness |
8.1-8.9 |
PDF |
PDF |
PPTX |
PDF, Whiteboard PDF |
|
CSE Home 
