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

Administrative
 Syllabus
 Midterm Study Guide
 Final Study Guide
Lecture Notes
 Dynamic Programming
 String Alignment
 Fractional Knapsack
 Huffman Codes
 Min Spanning Trees
 Dijkstra's Algorithm
 Depth First Search
 Max Flow
 NP-Complete
Assignments
 HW #1
 HW #2
 HW #3
 HW #4
 HW #5
 HW #6
 HW #7
   

Time: MWF 1:30-2:20
Place: 105 Loew
Office Hours Phone
Instructor: Larry Ruzzo, ruzzo@cs, MW 11:00-12:00, Sieg 415, 543-6298
TA: Ruth Anderson, rea@cs, Tu4:30-5:30, Sieg 226a
F11:30-12:30, Sieg 226b

Email Log: (All mail sent to cse421@cs. Last: 03/15/00, 01PM.)

Algorithm Animations: Here are some nice Java applets animating some of the algorithms we'll study this quarter. If you find other useful ones, please let me know and I'll add them.

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-2000, 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 cse421-webmaster@cs.washington.edu]