|CSE Home||CSE 421 Home||About Us||Search||Contact Info|
MWF 1:30-2:20 Raitt Hall 121
Grading: Homework 45-55%, midterm 15-20%, final 30-35%, give or take. Extra Credit.
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, email@example.com. 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.
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.