|
CSE 417, Wi '09: 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/5-1/9 |
M | Intro, Examples & Complexity | Ch. 1; Ch. 2 | |
| W | ||||
| F | Graph Algorithms | Ch. 3 | ||
| Week 2 1/12-1/16 |
M | |||
| W | HW #1 | |||
| F | Greedy Algorithms | Ch. 4 (4.4-4.6 are review; omit 4.7,4.9) | ||
| Week 3 1/19-1/23 |
M | Holiday | ||
| W | Greedy Algorithms | |||
| F | HW #2 | |||
| Week 4 1/26-1/30 |
M | |||
| W | ||||
| F | HW #3 | Dynamic Programming | Ch. 6 (omit 6.6-6.10) | |
| Week 5 2/2-2/6 |
M | |||
| W | ||||
| F | Midterm | |||
| Week 6 2/9-2/13 |
M | Dynamic Programming | ||
| W | ||||
| F | Divide & Conquer | Ch. 5 (omit 5.6) | ||
| Week 7 2/16-2/20 |
M | Holiday | ||
| W | Divide & Conquer | |||
| F | HW #4 | |||
| Week 8 2/23-2/27 |
M | |||
| W | ||||
| F | NP-Completeness & Intractability | Ch. 8 (omit 8.9, 8.10) | ||
| Week 9 3/2-3/6 |
M | |||
| W | HW #5 | |||
| F | ||||
| Week 10 3/9-3/13 |
M | |||
| W | ||||
| F | HW #6 | Final Review | ||
| Week 11 3/16-3/20 |
Tu | Final Exam |
||
 |
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX |