
CSE Home  CSE 421 Home  About Us  Search  Contact Info 

MWF 1:302:20 JHN
175
Grading: Homework 50%, midterm 20%, final 30%. Extra credit. Homework: There will be 8 roughly weekly homework assignments, due on Wednesdays. 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: Wednesday, February 12th, 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. SAMPLE Midterm SAMPLE Midterm Solutions Final Exam: Monday, March 17, 2014, 230420 pm, JHN 175. This will be open book and open notes. Here are some practice final exams for inspiration: Sample Final 1, Sample Final 2, Sample Final 3. 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: © 19932014, Department of Computer Science and Engineering, University of Washington. 