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