CSE 417: Algorithms and Computational Complexity,
Autumn 2024

Class Meetings:

Lecture: MWF 10:30-11:20 am, CSE2 G10

Contact Information:

Instructor: Richard Anderson, anderson@cs
Office hours: Monday 2:00-3:00 pm, Wednesday 3:00-4:00 pm, CSE2 344,

Teaching Assistant office hours: TBD

Textbook

Algorithm Design by Jon Kleinberg and Eva Tardos. Available at UW Bookstore and from internet retailers. All editions of this work are the same.

Discussion Board

The course will use the EDSTEM discussion board for Q & A.

Homework

Due Fridays at 11:59 pm. Homework will be accepted until 11:59 pm on Sunday. Students will have five free late days, otherwise late homework will have a 25% per day penalty.

Midterm Exam (Tentative, subject to change): Friday, November 1, In class

Practice midterm problems from old CSE 417 and CSE 421 Exams:
Sample problems Solutions to some of the sample problems Winter 2023 Midterm (no solutions available)
Important note - not all of these problems will be appropriate this quarter due to lecture coverage. In particular, recurrences will not be on the midterm. (Problems 11 and 18 in the sample problems. Problem 13 is also out of scope.)

Final Exam: Monday, December 9, 8:30 AM - 10:20 AM



Practice exams (Note: There is some variation in material, emphasis, and coverage from year to year, so not all of the questions on previous exams would be appropriate in any given year. These exams were 2 hour in class exams.) Old final exam. Solutions to old final. Practice final 2009, Answerkey 2009 Old exam Old exam Winter 2023, CSE417 (Note: Winter 2023 did not cover network flow, and had more time on NP-Completeness.)