The Steam Powered Turing Machine University of Washington Department of Computer Science & Engineering
 CSE 421: Introduction to Algorithms, Autumn 2007
  CSE Home   CSE 421 Home  About Us    Search    Contact Info 

  Sign-up Instructions
Homework Assignments
  Assignment #1
  Assignment #2
  Assignment #3
  Assignment #4
  Assignment #5
  Assignment #6
  Assignment #7
  Assignment #8
Reading Assignments
  Chapter 1
  Chapter 2
  Chapter 3
  Sections 4.1-4.7
  Chapter 5
  Algebraic Algorithms (Divide & Conquer)
  Chapter 6
  Sections 7.1-7.3,7.5-7.6,7.11
  Chapter 8
Lecture Notes
  Graph Traversal
  Alternate Greedy
  Divide and Conquer
  Dynamic Programming
  Network Flow
  Dealing with NP-completeness
  Grading Guidelines
  Midterm Topics
Useful Links
  SB Algorithm Repository
MWF 1:30-2:20    JHN 111

Office Hours Location Phone
Instructor: Paul Beame   beame@cs  
MW 2:20-3:00
and by appointment
CSE 668 543-5114
TAs: Widad Machmouchi widad at cs Th 2:30-3:30 CSE 624
T 2:30-3:20 CSE 218
Eric McCambridge ericm6 at cs Th 11:30-12:20 CSE 218

Grading: Homework 45-55%, midterm 15-20%, final 30-35%, give or take. Extra Credit.

Homework: There will be 8 roughly weekly homework assignments, due on Fridays early in the quarter. Please read the grading guidelines to help you understand what is expected on your homework.


  • Algorithm Design by Jon Kleinberg and Eva Tardos, Addison-Wesley, 2006.

    We will cover almost all of chapters 1-8 of the Kleinberg/Tardos text. In addition, I will borrow a small amount of material on divide and conquer algorithms from Introduction to Algorithms: A Creative Approach, by Udi Manber, Addison-Wesley 1989. I will hand out extra material for this.

Another handy reference is Steven Skiena's Stonybrook Algorithm Repository which is also listed in the Useful Links section on the left column of this page.

Mailing List: There is a class mailing list, Follow the link in the left column on this page to sign up. Everyone is expected to be reading cse421 e-mail to keep up-to-date on the course.

Midterm Exam: Wednesday, Nov 7 in class. This will be open book and open notes. There will be a review session on Tuesday, Nov 6 at 4:35 pm, EEB 037. Midterm Topics.  Old Sample Midterm Solutions to Sample

Final Exam: Monday, December 10, 2:30-4:20 p.m. This will be open book and open notes. There will be a review session on Sunday, Dec 9 at 4:00 pm, EEB 045. Final Exam Topics.  Sample Final Exam Old Practice Final Solutions to Practice Final

Suggestions or Comments? You can send comments to the instructor or TA using this anonymous feedback form

Catalog Description: Techniques for design of efficient algorithms. Methods for showing lower bounds on computational complexity. Particular algorithms for sorting, searching, set manipulation, arithmetic, graph problems, pattern matching. Prerequisite: CSE 322; CSE 326.

Portions of the CSE 421 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSE 421 Web: © 1993-2007, Department of Computer Science and Engineering, University of Washington.