|
CSE 417, Wi '05: Approximate Schedule |
|
 CSE Home |
About Us |
Search |
Contact Info |
| Due | Lecture Topic | Reading | ||
|---|---|---|---|---|
| Week 1 1/3-1/7 |
M | Introduction | Read Ch. 1; Review Ch. 2 | |
| W | An Example | |||
| F | Complexity | |||
| Week 2 1/10-1/14 |
M | Dynamic Programming | Read 3.1-3.5 | |
| W | Dynamic Programming | |||
| F | HW #1 | Dynamic Programming | ||
| Week 3 1/17-1/21 |
M | Holiday | ||
| W | Dynamic Programming | Read 3.1-3.5 | ||
| F | Dynamic Programming | |||
| Week 4 1/24-1/28 |
M | HW #2 | Dynamic Programming | |
| W | Dynamic Programming | |||
| F | Dynamic Programming | |||
| Week 5 1/31-2/4 |
M | HW #3 | Divide & Conquer | Read 3.6, 8.2.3, 8.2.9 |
| W | Divide & Conquer | |||
| F | Midterm | |||
| Week 6 2/7-2/11 |
M | Divide & Conquer | Read 3.6, 8.2.3, 8.2.9 | |
| W | Divide & Conquer | |||
| F | Graph Algorithms | Read Ch. 4 | ||
| Week 7 2/14-2/18 |
M | Graph Algorithms | ||
| W | HW #4 | Graph Algorithms | ||
| F | Graph Algorithms | |||
| Week 8 2/21-2/25 |
M | Holiday | ||
| W | Graph Algorithms | Read Ch. 4 | ||
| F | Graph Algorithms | |||
| Week 9 2/28-3/4 |
M | HW #5 | NP-Completeness & Intractability | Read Sects 5.1--5.2, Ch 6, Sect 8.5--8.5.5 |
| W | NP-Completeness & Intractability | |||
| F | NP-Completeness & Intractability | |||
| Week 10 3/7-3/11 |
M | NP-Completeness & Intractability | ||
| W | HW #6 (Thurs.) | NP-Completeness & Intractability | ||
| F | Final Review | |||
| Week 11 3/14-3/18 |
Th | Final Exam |
||
 |
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX [comments to cse417-webmaster@cs.washington.edu] |