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

Email
  Archive (Last: [an error occurred while processing this directive])
  Sign-up Instructions
Homework Assignments
  Assignment #1
  Assignment #2
  Assignment #3
  Assignment #4
  Assignment #5
  Assignment #6
  Assignment #7
Reading Assignments
  Chapter 7
  Sections 6.1-6.5,6.7,6.9
  Chapter 5
  Chapter 4
  Chapter 3
  Chapter 2
  Chapter 1
Lecture Notes
  Overview
  Graphs and Graph Traversal
  Greedy Algorithms
  Divide and Conquer
  Dynamic Programming
  Network Flow
  NP Completeness
  Handling NP Completeness
Administrative
  Syllabus
  Grading Guidelines
  Midterm Topics
  Final Exam Topics
Useful Links
  SB Algorithm Repository
   
MWF 1:30-2:20    Raitt Hall 121

Office Hours Location Phone
Instructor: Paul Beame   beame@cs   Wed, Thu 11-12 or by appointment Sieg 416 543-5114
TAs: Ioannis Giotis   giotis@cs   Thu 2-3 Sieg 226b
Samir Shaunak   samir@cs   Tue 2-3 Sieg 226b

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

Textbook

  • Introduction to Algorithms by Jon Kleinberg and Eva Tardos. This is a pre-print available from Professional Copy and Print, 4200 University Way (one block S. of the University Bookstore), for $26.20 plus tax.

In addition, I will borrow a small amount of material from Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest, and Stein which should be available from the University Bookstore. Used copies may be available there or through on-line retailers such as Amazon.com.

Our main textbook is a work in progress and does not have an index, so it is not currently suitable as a reference book. The CLRS text is as good as any to serve as an algorithms and data structures handbook for future use.

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, cse421@cs.washington.edu. 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 14 in class.

Final Exam: Monday, March 17, 2:30-4:20 p.m. in class. See study guide.

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