|
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 1/7-1/11 |
M | Intro, Examples & Complexity | Ch. 1; Ch. 2 [DPV 0.3] | |
W | ||||
F | Graph Algorithms | Ch. 3 [DPV 3,4] | ||
Week 2 1/14-1/18 |
M | |||
W | HW #1 | |||
F | ||||
Week 3 1/21-1/25 |
M | Holiday | ||
W | HW #2 | Greedy Algorithms | Ch. 4 (4.4-4.6 are review; omit 4.3, 4.7,4.9) [DVP 5] | |
F | ||||
Week 4 1/28-2/1 |
M | |||
W | HW #3 | Divide & Conquer | Ch. 5 (omit 5.6) [DPV 2] | |
F | ***Lectures Canceled*** | |||
Week 5 2/4-2/8 |
M | |||
W | Divide & Conquer | |||
F | HW #4 | ***Lectures Canceled*** | ||
Week 6 2/11-2/15 |
M | |||
W | Divide & Conquer | |||
F | HW #5 | Midterm Review + Dyn. Prog. | ||
Week 7 2/18-2/22 |
M | Holiday | ||
W | Midterm | |||
F | Dynamic Programming | Ch. 6 (omit 6.6-6.10) [DPV 6] | ||
Week 8 2/25-3/1 |
M | |||
W | HW #6 | |||
F | ||||
Week 9 3/4-3/8 |
M | NP-Completeness & Intractability | Ch. 8 (omit 8.9, 8.10) [DPV 8,9] | |
W | HW #7 | |||
F | ||||
Week 10 3/11-3/15 |
M | |||
W | HW #8 | |||
F | Final Review | |||
Week 11 3/18-3/22 |
M | Final Exam |
Textbook: Algorithm Design by Jon Kleinberg and Eva Tardos. Addison Wesley, 2006. (Available from U Book Store, Amazon, etc.)
Supplementary References: There are many good algorithms books, if you want to see additional perspectives on the material. A few are listed below, but you can find others in the UW libraries and online. The reading list above include some pointers into these resources, all optional, not required reading. If you find other sources that you like, please feel free to post them on the class bboard, or email me.
[DPV]: Algorithms, by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, McGraw-Hill
[SS]: The Algorithm Design Manual, Steven S Skiena, Springer
[TR]: Coursera MOOC, Tim Roughgarden.
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX |