|CSE Home||CSE 421 Home||About Us||Search||Contact Info|
MWF 2:30-3:20 MGH 241
NOTE: May 20, class is in THO 325
Grading: Homework 45-55%, midterm 15-20%, final 30-35%, give or take. Extra Credit.
Homework: There will be 8 roughly weekly homework assignments. Please read the grading guidelines to help you understand what is expected on your homework.
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, May 6, in class. This will be open book and open notes (hard copies only). The following is a list topics for the midterm. There will be a review session in room CSE 403 on Thursday, May 5 at 4:30-6:00 pm. Also, there is a Sample Old Midterm Solutions to Sample Midterm.
Final Exam: Tuesday, June 7, 2:30-4:20 p.m. This will be open book and open notes, hard copy only. Here is a list of topics for the final. There will be a review session Monday, June 6, 4:30-6 in CSE 403. There are an old final exam and a practice final from previous offerings of the course. Solutions to the practice final.
Suggestions or Comments? You can send comments to the instructor and TAs via the e-mail list "cse421-staff 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: CSE 312; 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: © 1993-2016, Department of Computer Science and Engineering, University of Washington.