|
CSE 417, Wi '12: Approximate Schedule |
|
 CSE Home |
About Us |
Search |
Contact Info |
Schedule details will evolve as we go; please check back here every week or so to see the latest updates.
| Due | Lecture Topic | Reading | ||
|---|---|---|---|---|
| Week
1 1/2-1/6 |
M | Holiday | ||
| W | Intro, Examples & Analysis | Ch. 1, Ch. 2.1-2.4, Lecture notes | ||
| F | HW 0 | |||
| Week
2 1/9-1/13 |
M | Graph Algorithms | Ch. 3, Lecture notes | |
| W | HW 1 | |||
| F | ||||
| Week
3 1/16-1/20 |
M | Holiday | ||
| W | Snow Day | |||
| F | Snow Day | |||
| Week
4 1/23-1/27 |
M | HW 2 | Greedy Algorithms | Ch. 4.1-4.2,4.5, Lecture notes |
| W | ||||
| F | ||||
| Week
5 1/30-2/3 |
M | Divide & Conquer | Ch. 5.1, 5.4, 5.5, Ch. 13.5 Lecture notes | |
| W | HW 3 | |||
| F | ||||
| Week
6 2/6-2/10 |
M | |||
| W | Midterm | |||
| F | Dynamic Programming | Ch. 6.1-6.4 Lecture notes | ||
| Week
7 2/13-2/17 |
M | |||
| W | HW 4 | |||
| F | ||||
| Week
8 2/20-2/24 |
M | Holiday | ||
| W | HW 5 | NP-Completeness & Intractability | Ch. 8.1-8.4, Lecture Notes | |
| F | ||||
| Week
9 2/27-3/2 |
M | |||
| W | HW 6 | |||
| F | ||||
| Week
10 3/5-3/9 |
M | Beyond NP-completeness | Ch. 10.1-10.2, 11.4, 13.4, Lecture Notes | |
| W | HW 7 | |||
| F | Final Review | |||
| Week
11 3/12-3/16 |
Tu |
Final
Exam |
||
|
|
|
 |
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX |