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

 Midterm Study Guide
 Midterm Sample
 Final Study Guide
Lecture Notes
 Dynamic Programming
 String Alignment
 Matrix Chain Products
 Fractional Knapsack
 Huffman Codes
 Min Spanning Trees
 Articulation Points
 Strongly Connected Components
 Max Flow
 HW #1
 HW #2
 HW #3
 HW #4
 HW #5
 HW #6

Time: MWF 1:30-2:20
Place: EE1 037
Office Hours Phone
Instructor: Larry Ruzzo, ruzzo@cs, MW2:30-3:20, CSE 554, 543-6298
TA: Bill Pentney, bill@cs, Tu11:30-12:30, CSE 216
F 12:30-1:30, CSE 216

Class mail archive (All mail sent to cse421@cs. Manage your subscription here.)

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.
Prerequisites: CSE 322; CSE 326.
Credits: 3

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

CSE logo Department of Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA  98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX
[comments to]