CSE 417,  Wi '19:  Algorithms & Computational Complexity

CSE Home

About Us

Search

Contact Info

Administrative  FAQ  Schedule & Reading  Midterm Review  Final Review Course Email/BBoard  Subscription Options  Class List Archive  E-mail Course Staff  Google Groups BBoard Lecture Notes  1:  Overview & Example  2:  Analysis  3:  Graphs, B/DFS  4:  Greedy:    Scheduling    Huffman  5:  Divide & Conquer  6:  Dynamic Programming:    Intro    Sched & Knapsack    RNA Structure    String Alignment  8:  P & NP Lecture Recordings  Here

Lecture:  JHN 102 (room info) MWF 1:30- 2:20    Office Hours Location Phone Instructor:  Larry Ruzzo, ruzzocs  F 2:30- 3:30  CSE 554  (206) 543-6298 TAs:  Yuqing Ai, yuqingaics  Tu 1:00- 2:00  4th floor breakout (@ main stairs)    Daniel Jones, dcjonescs  W 11:30- 12:30  CSE 220    Saidutt Nimmagadda, nimmascs  M 11:00- 12:00  CSE 220    Alex Okeson, amokesoncs  Tu 2:30- 3:30  CSE 021    Alireza Rezaei, arezaeics  M 12:00- 1:00  CSE 624  Course Email: cse417a_wi19@uw.edu. Staff announcements and general interest student/staff Q&A about homework, lectures, etc. The instructor and TAs 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 the course-specific Google Group 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; additional 15% per day thereafter. (Day = calendar day, i.e., Sunday is later than Saturday.) Required Text: Algorithm Design by Jon Kleinberg and Eva Tardos. Addison Wesley, 2006. (Available from U Book Store, Amazon, etc.) References: See Schedule & Reading. 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-2019, 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