|
CSE Home | CSE 521 | About Us | Search | Contact Info |
|
Lecture Tuesday and Thursday 10:30-11:50 EEB 045 TextbooksAlgorithm Design (first edition), J. Kleinberg and E. Tardos, required.On reserve in the Engineering Library Algorithms by S. Dasgupta, C.H. Papadimitriou and U.V. Vazirani, optional. Course OverviewThe course will cover the key principles behind designing efficient algorithms: recursion, divide and conquer, dynamic programming, greedy methods, network flow and linear/convex programming. We will also discuss NP completeness, online algorithms and spectral algorithms, time permitting.Grading
Late policyYou have one free late day throughout the quarter, which means that you can turn in one assignment one lecture late (i.e. normally on the Thursday of that week). Otherwise (meaning for assignments that are more than one lecture late, or for any late homework after the first one), no credit will be given for late assignments. No late days can be used for the last assignment or the midterm.Requesting academic accommodationsIf you require academic accommodations due to a disability, please contact Disabled Student Services, 448 Schmitz, 543-8924, (TTY) 543-8925, uwdss@u.washington.edu. They will give you a letter requesting academic accommodations. Please present the letter to the instructor and we will make the accommodations you need for class.CollaborationApart from the mid-term, we encourage collaboration on homework, provided (1) You make a credible effort to solve each problem yourself (at least 30 minutes of work is a good guideline), before discussing it with others, (2) You write the names of people you collaborated with for each problem, and (3) You write up each solution in your own writing, using your own words, and understand the solution fully. When discussing homework on the forum, try not to post answers. |
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX [comments to Aram Harrow] |