CSE 521,  Wi '13:  Design and Analysis of Algorithms I

CSE Home

About Us

Search

Contact Info

Administrative  FAQ  Schedule & Reading  Final Review Course Email/BBoard  Class List Archive  GoPost BBoard Lecture Notes  1:  Overview & Example  2:  Analysis  3:  Graphs:    Biconnectivity    Strong Connectivity  4:  Greedy:    Scheduling    Huffman & Arith Codes  5:  Divide & Conquer    Basic Examples    FFT  6:  Dynamic Programming:    Intro    Sched & Knapsack    RNA Structure    String Alignment    Code Generation  7:  Max Flow    Slides    Edmonds-Karp-Dinitz example  8:  P & NP  9:  LP

Lecture:  MGH 271 (schematic)   Office Hours Location Phone Instructor:  Larry Ruzzo, ruzzocs  M 12:00- 1:00  CSE 554  206-543-6298 TA:  Cyrus Rashtchian, cyrashcs  Tu 5:00- 6:00  CSE 305      W 4:00- 5:00  CSE 306  Course Email: cse521a_wi13@uw.edu. Staff announcements and general interest student/staff Q&A about homework, lectures, etc. The instructor and TA are subscribed to this list. Enrolled students are as well, but probably should change their default subscription options. Messages are automatically archived.  Discussion Board: Also feel free to use Catalyst GoPost to discuss homework, etc. 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. Prerequisites: CSE major and CSE 326 or equivalent. CSE majors only. Credits: 4 Grading: Homework, Final. Overall weights 60%, 40%, roughly. Late Policy: Unless otherwise announced, homework is due at the start of class on the due date. 20% off per day thereafter (business day, e.g., Monday for Friday due dates). Extra Credit: Assignments may include "extra credit" sections. These will enrich your understanding of the material, but at a low points per hour ratio. Do them for the glory, not the points, and don't start extra credit until the basics are complete. Collaboration: Homeworks are all individual, not group, exercises. Discussing them with others is fine, even encouraged, but you must produce your own homework solutions. Follow the "Gilligan's Island Rule": if you discuss the assignment with someone else, don't keep any notes (paper or electronic) from the discussion, then go watch 30+ minutes of TV (Gilligan's Island reruns especially recommended) before you continue work on the homework by yourself. You may not look at other people's written solutions to these problems, not in your friends' notes, not in the dorm files, not on the internet, ever. If in any doubt about whether your activities cross allowable boundaries, tell us before, not after, you turn in your assignment. See also the UW CSE Academic Misconduct Policy, and the links there. Textbook: Algorithm Design by Jon Kleinberg and Eva Tardos. Addison Wesley, 2006. (Available from U Book Store, Amazon, etc.) 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-2013, the Authors and the Department of Computer Science and Engineering, University of Washington.

	Computer Science & Engineering University of Washington Box 352350 Seattle, WA  98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX