|
CSE 421, Su '11: Approximate Schedule |
|
 CSE Home |
About Us |
Search |
Contact Info |
| Due | Lecture Topic | Reading | ||
|---|---|---|---|---|
| Week 1 6/20-6/24 |
M | Intro, Examples & Complexity | Ch. 1; Ch. 2 | |
| W | Graph Algorithms | Ch. 3 | ||
| Week 2 6/27-7/1 |
M | HW #1 | ||
| W | Greedy Algorithms | Ch. 4 (4.4-4.6 is review; omit 4.7,4.9) | ||
| Week 3 7/4-7/8 |
M | Holiday | ||
| W | Greedy Algorithms | |||
| Week 4 7/11-7/15 |
M | HW #2 | Divide & Conquer | Ch. 5 (omit 5.6) |
| W | ||||
| Week 5 7/18-7/22 |
M | HW #3 | Dynamic Programming | Ch. 6 (omit 6.7-6.10) |
| W | ||||
| Week 6 7/25-7/29 |
M | HW #4 | Network Flow | 7.1-7.3, 7.5-7.6, 7.12 |
| W | ||||
| Week 7 8/1-8/5 |
M | HW #5 | NP-Completeness & Intractability | Ch. 8 (omit 8.9, 8.10) |
| W | ||||
| Week 8 8/8-8/12 |
M | HW #6 | ||
| W | ||||
| Week 9 8/15-8/19 |
M | HW #7 | 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 |