
CSE Home  CSE 421 Home  About Us  Search  Contact Info 
MWF 1:302:20 MGH
241
Grading: Homework 4555%, midterm 1520%, final 3035%, give or take. Extra Credit. Homework: There will be 8 roughly weekly homework assignments, due on Fridays early in the quarter. Please read the grading guidelines to help you understand what is expected on your homework. Textbook
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.
Midterm Exam: Friday, November 2 in class. This will be open book (hard copies only) and open notes. Topics for the midterm include material up to the end of dynamic programming. There will be a review session Thursday Nov 1 at 4:30, EEB 045. Old Sample Midterm Solutions to Sample Midterm Final Exam: Monday, December 10, 2:304:20 p.m. This will be open book and open notes. Final Exam Topics There will be a review session on Sunday December 9, 4:00 pm in EEB 037. Old Final Exam Sample from Practice Final Solutions to Sample Practice Final Suggestions or Comments? You can send comments to the instructor and TAs via the email list "cse421staff at cs" 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: either CSE 312 or CSE 322; either CSE 326 or CSE 332. 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: © 19932012, Department of Computer Science and Engineering, University of Washington. 