CSE 417,  Wi '22:  Algorithms & Computational Complexity

CSE Home

About Us

Search

Contact Info

Administrative  FAQ  Schedule & Reading Course Email/BBoard  Subscription Options  Class List Archive  E-mail Course Staff  ED Discussion Board Lecture Notes  1:  Overview  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: (By Zoom, Week 1 at least), MWF 9:30-10:20 Zoom: https://washington.zoom.us/j/94357067917  Requires login to Zoom with a UWNetID.   Office Hours Location Phone Instructor:  Larry Ruzzo, ruzzocs  M 2:00- 2:50  Zoom (Requires login to Zoom with a UWNetID.)  TAs:  Nathan Akkaraphab, akkanathcs  W 3:30- 4:20  Zoom (Requires login to Zoom with a UWNetID.)    Todor Dimitrov, todordcs  F 10:30- 11:20  Zoom (Requires login to Zoom with a UWNetID.)    William Nguyen, williamvcs  W 2:00- 2:50  Zoom (Requires login to Zoom with a UWNetID.)    Lin Qiu, lq9cs  Th 1:00- 1:50  Zoom (Requires login to Zoom with a UWNetID.)    Luna Wang, zhengw28cs  Th 5:00- 5:50  Zoom (Requires login to Zoom with a UWNetID.)    Yifan Zhang, yifanz47cs  Th 3:30- 4:20  Zoom (Requires login to Zoom with a UWNetID.)    Yilin Zhang, yilinz24cs  Tu 3:30- 4:20  Zoom (Requires login to Zoom with a UWNetID.)  Course Email: cse417a_wi22@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 EDStem Board 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, Late Policy, Collaboration: Here. 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-2022, 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