|CSE Home||CSE 521 Home||About Us||Search||Contact Info|
Tuesdays and Thursdays 10:30-11:50 EEB 037
Grading: The grading split will be 50% on homework and 50% on tests with 5 roughly bi-weekly homework assignments each worth 10%, a take-home midterm worth 15-20% and an in-class final exam worth 30-35%.
Homework: There will be 5 roughly bi-weekly homework assignments, due on roughly alternate Thursdays. Please read the grading guidelines to help you understand what is expected on your homework. Please typeset your homework to the extent possible so that your work is legible.
Textbook: Algorithm Design by Jon Kleinberg and Eva Tardos, Addison-Wesley, 2006.
There will be additional material in the latter half of the course.
Mailing List: There is a class mailing list, firstname.lastname@example.org. Follow the link in the left column on this page to sign up. Everyone is expected to be reading cse521 e-mail to keep up-to-date on the course.
Midterm: The midterm will a take-home exam. Handed out Feb 18 and due Feb 23 at the start of class. Here is an old take home midterm.
Final Exam: This will be an in-class exam with open book and open notes on Monday March 15, 10:30-12:20 as in the official exam schedule. Here is an old final exam. There will be a review session Sunday March 14, 4:00 pm in room CSE 403.
Catalog Description: Principles of design of efficient algorithms: recursion, divide and conquer, balancing, dynamic programming, greedy method, network flow, linear programming. Correctness and analysis of algorithms. NP-completeness. Prerequisite: CSE major and CSE 326 or equivalent. CSE majors only.
Portions of the CSE 521 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSE 521 Web: © 1993-2010, Department of Computer Science and Engineering, University of Washington.