My CSE  CSE 417, Wi '12: Algorithms and Computational Complexity

CSE Home

About Us

Search

Contact Info

Administrative  Home (Syllabus)  Schedule  Discussion Board Homeworks  Homework 0  Homework 1  Homework 2  Homework 3  Homework 4  Homework 5 (Supporting materials)  Homework 6  Homework 7 Lecture Notes  Intro, Examples, Analysis (1-up)  Graphs (1-up)  Greedy Algorithms (1-up)  Divide and Conquer (1-up)  Dynamic Programming (1-up)  P, NP, and Intractability (1-up)  Beyond NP-Completeness (1-up) Handouts  Proof by Induction  Recurrences  Midterm Review  Final Review

Lecture:  EEB 037 (schematic) MWF 2:30-3:20   Email Office Hours Instructors:  Ben Birnbaum birnbaum at cs M 11:00-12:00 (CSE 212)   Widad Machmouchi widad at cs T 2:30-3:30 (CSE 212) TAs: Nara Kim, narakim at uw Th 4:00-5:00 (CSE 218)   Alex Piet alexpiet at uw T 4:00-5:00 (CSE 220) Course Discussion Board: All publicly-appropriate questions regarding homework, lectures, etc. should be asked on this board. The instructors and TAs will monitor it regularly. Schedule: Contains the schedule of readings, lecture notes, and homeworks. Check this often -- it will be updated as the course progresses. Homework policy: To facilitate grading, each question should be turned in on its own page. There will be approximately eight homeworks, usually due on Wednesdays. Most homeworks will be written algorithmic design questions. A few problems may be short programming exercises. Students may discuss homework problems together, but they must write their own solutions. Late homeworks will not be accepted. If there are extenuating circumstances, prior permission must be requested from one of the instructors. Outside sources (Google, other textbooks, people not in the class, etc.) may not be consulted. With permission, we may share with the class a few outstanding homework solutions written by students. The purpose of this is to give examples of what really good proofs and analyses look like. If we do this, we will do it anonymously, and the student whose solution is chosen will receive a small amount of extra credit. Grading: An overall numeric grade will be calculated using the weighting: homework 60%, midterm 15%, final 25%. This numeric grade will be converted to a course grade at the end of the course. Extra credit will be tallied separately and considered subjectively when calculating the course grade. Prerequisite: CSE 373 Credits: 3 Textbook: Algorithm Design by Jon Kleinberg and Eva Tardos. Addison Wesley, 2006. (Available from the U Book Store, Amazon, etc.) Based on past experience, we will probably have little if any time to cover the "computability" material outlined in the catalog description. If you want additional material on these topics, as well as an alternative presentation of the computational complexity/NP-completeness topics, we recommend: Michael Sipser, Intro. to the Theory of Computation, 2nd ed., Thompson Course Technology, 2005. Errata. (Available from Amazon, etc.) Portions of the CSE 417 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSE 417 Web: © 1993-2012, Department of Computer Science and Engineering, University of Washington.

	Computer Science & Engineering Box 352350, University of Washington Seattle, WA  98195-2350 (206) 543-1695 [comments to birnbaum] Privacy policy and terms of use