CSE 421,  Su '04:  Introduction to Algorithms

CSE Home

About Us

Search

Contact Info

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

Time: TuTh 9:40--11:10 Place: Mor 221 Office Hours Phone Instructor:  Larry Ruzzo      ruzzo@cs  TuTh  11:10- 12:00,  AC 554,  543-6298 TA:  Ethan Phelps-Goodman      ethanpg@cs  M  11:00- 12:00,  AC 218  Class Email:   cse421@cs.washington.edu    Your Subscription   Archives Please subscribe.  Feel free to use the list to ask/answer questions; often, many of your classmates have the same question and/or know the answers.  Instructor and TA read the list, too. 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.

	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]