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