|
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/27-3/31 |
M | Intro, Examples | Ch. 1 | |
W | ||||
F | Complexity | Ch. 2; (2.5 should be review; skim it, reading unfamiliar parts more carefully.) | ||
Week 2 4/3-4/7 |
M | Graph Algorithms | Ch. 3 | |
W | ||||
F | HW #1 | |||
Week 3 4/10-4/14 |
M | Greedy Algorithms | Ch. 4 (4.4-4.6 is review; omit 4.7,4.9) | |
W | ||||
F | HW #2 | |||
Week 4 4/17-4/21 |
M | |||
W | Divide & Conquer | Ch. 5 (Omit 5.6) | ||
F | HW #3 | |||
Week 5 4/24-4/28 |
M | |||
W | Dynamic Programming | Ch. 6 (Omit 6.7-6.10) | ||
F | Midterm | |||
Week 6 5/1-5/5 |
M | Dynamic Programming | ||
W | ||||
F | HW #4 | |||
Week 7 5/8-5/12 |
M | |||
W | Network Flow | Ch. 7.1-7.3, 7.5-7.6, 7.12 | ||
F | HW #5 | |||
Week 8 5/15-5/19 |
M | |||
W | NP-Completeness & Intractability | Ch. 8 (Omit 8.9, 8.10) | ||
F | HW #6 | |||
Week 9 5/22-5/26 |
M | |||
W | ||||
F | HW #7 | |||
Week 10 5/29-6/2 |
M | Holiday | ||
W | NP-Completeness & Intractability | |||
F | HW #8 | NP Wrap up & Final Review | ||
Week 11 6/5-6/9 |
Tu | Final Exam |
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX |