|
CSE 417, Sp '14: Approximate Schedule |
|
 CSE Home |
About Us |
Search |
Contact Info |
Schedule details will evolve as we go; check back periodically to see the latest updates.
| Due | Lecture Topic | Reading | ||
|---|---|---|---|---|
| Week 1 3/31-4/4 |
M | Intro, Examples & Complexity | Ch. 1; Ch. 2 | |
| W | ||||
| F | Graph Algorithms | Ch. 3 | ||
| Week 2 4/7-4/11 |
M | |||
| W | HW #1 | |||
| F | ||||
| Week 3 4/14-4/18 |
M | Greedy Algorithms | Ch. 4 (4.4-4.6 are review; omit 4.3, 4.7,4.9) | |
| W | HW #2 | |||
| F | ||||
| Week 4 4/21-4/25 |
M | |||
| W | HW #3 | Divide & Conquer | Ch. 5 (omit 5.6) | |
| F | ||||
| Week 5 4/28-5/2 |
M | |||
| W | HW #4 | |||
| F | Dynamic Programming | Ch. 6 (omit 6.6-6.10) | ||
| Week 6 5/5-5/9 |
M | |||
| W | Midterm Review | |||
| F | Midterm | |||
| Week 7 5/12-5/16 |
M | Dynamic Programming | ||
| W | HW #5 | |||
| F | ||||
| Week 8 5/19-5/23 |
M | |||
| W | HW #6 | NP-Completeness & Intractability | Ch. 8 (omit 8.9, 8.10) | |
| F | ||||
| Week 9 5/26-5/30 |
M | Holiday | ||
| W | HW #7 | NP-Completeness & Intractability | ||
| F | ||||
| Week 10 6/2-6/6 |
M | |||
| W | HW #8 | |||
| F | Final Review | |||
| Week 11 6/9-6/13 |
Th | Final Exam |
||
 |
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX |