The Steam Powered Turing Machine University of Washington Department of Computer Science & Engineering
 CSE 421: Introduction to Algorithms, Winter 2005
  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 7
  Chapter 6
  Chapter 5
  Chapter 4
  Chapter 3
  Chapter 2
  Chapter 1
Lecture Notes
  Graph Traversal
  Greedy Algorithms
  Dynamic Programming
  Divide and Conquer
  Dealing with NP-completeness
  Grading Guidelines
  Midterm Topics
  Final Exam Topics
Useful Links
  SB Algorithm Repository
MWF 1:30-2:20    EE1 045

Office Hours Location Phone
Instructor: Paul Beame   beame@cs   M 2:20-2:50, W 11:00-12:00,
or by appointment
CSE 668 543-5114
TAs: Yiannis Giotis   giotis@cs   W 3:30-4:20 CSE 218
Th 2:00-2:50 CSE 216
Peter-Michael Osera   psosera@cs   Th 3:30-4:20 CSE 216

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


  • Algorithm Design by Jon Kleinberg and Eva Tardos. This is a pre-print of a textbook soon to be published by Addison-Wesley and is available from Professional Copy and Print, 4200 University Way (one block S. of the University Bookstore).

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: Friday, February 11 in class. This will be open book open notes. There is a list of Final Exam: Monday, March 14, 2:30-4:20 p.m. There is a list of final exam topics. There will be a review session Sunday afternoon March 13, 2:00 pm in EE1 045.

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-2005, Department of Computer Science and Engineering, University of Washington.