|
CSE Home | About Us | Search | Contact Info |
|
Course Email: cse417a_sp14@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: Design and analysis of algorithms and data structures. Efficient algorithms for manipulating graphs and strings. Fast Fourier Transform. Models of computation, including Turing machines. Time and space complexity. NP-complete problems and undecidable problems. Prerequisite: CSE 373 Credits: 3 Grading: Homework, Midterm, Final. Homework will be a mix of paper & pencil exercises and programing. Overall weights 55%, 15%, 30%, roughly. Late Policy: Papers and/or electronic turnins are due at the start of class on the due date. 10% off for up to one day late (business day, e.g., Monday for Friday due dates); additional 20% per day thereafter. Textbooks: Algorithm Design by Jon Kleinberg and Eva Tardos. Addison Wesley, 2006. (Available from U Book Store, 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-2014, 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 |