CSE 521: Design & Analysis of AlgorithmsI, Winter 2010

CSE Home

CSE 521 Home

About Us

Search

Contact Info

Email   Archive    Sign-up Instructions Homework Assignments   Assignment 0: Due Jan 7   Assignment 1: Due Jan 21   Assignment 2: Due Feb 4   Assignment 3: Due Feb 18   Assignment 4: Due Mar 4   Assignment 5: Due Mar 12   Assignment 5 Solutions MIDTERM Reading Assignments   Multiplicative Weights (Kale Thesis Chapter)   Linear Programming Notes   Chapter 8   Chapter 7   Chapter 6   Chapter 5   Chapter 4   Chapters 1 to 3 Lecture Slides   Stable Matching   Representative Problems   Greedy Algorithms   Divide and Conquer   Primality Testing   Dynamic Programming   Network Flow   NP-completeness   Dealing with NP-completeness   Linear Programming   Multiplicative Weights Update Method   Hashing Data Structures Administrative   Catalyst Gradebook Useful Links

Tuesdays and Thursdays 10:30-11:50    EEB 037 Office Hours Location Phone Instructor: Paul Beame   beame@cs   Mondays 2:30-3:20 (previous Friday if holiday Monday), Wednesdays 1:30-2:00 and by appointment CSE 668 543-5114 TA: Trinh Huynh trinh at cs Tuesdays 12:00-12:50, Wednesdays 2:00-2:50 TBA 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, cse521@cs.washington.edu. 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.