|
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 6/18-6/22 |
M | Intro, Examples & Complexity | Ch. 1; Ch. 2 | |
W | Graph Algorithms | Ch. 3 | ||
Week 2 6/25-6/29 |
M | |||
W | HW #1 | Greedy Algorithms | Ch. 4 (4.4-4.6 is review; omit 4.7,4.9) | |
Week 3 7/2-7/6 |
M | |||
W | HW #2 | Holiday | ||
Week 4 7/9-7/13 |
M | Dynamic Programming | Ch. 6 (omit 6.7-6.10) | |
W | ||||
Week 5 7/16-7/20 |
M | |||
W | HW #3 | Divide & Conquer | Ch. 5 (omit 5.6) | |
Week 6 7/23-7/27 |
M | |||
W | HW #4 | |||
Week 7 7/30-8/3 |
M | Network Flow | 7.1-7.3, 7.5-7.6 | |
W | HW #5 | |||
Week 8 8/6-8/10 |
M | NP-Completeness & Intractability | Ch. 8 (omit 8.9, 8.10) | |
W | HW #6 | |||
Week 9 8/13-8/17 |
M | HW #7 | ||
W | Final Exam |
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX |