|CSE Home||About Us||Search||Contact Info|
Course Email: email@example.com. Staff announcements and general interest student/staff Q&A about homework, lectures, etc. The instructor and TA are subscribed to this list. Enrolled students are as well, but probably should change their default subscription options. Messages are automatically archived.
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.
Grading: Homework, Final. Homework will be a mix of paper & pencil exercises and programing. Overall weights 60%, 40%, roughly.
Late Policy: Unless otherwise announced, 20% off per calendar day after the due date. (Outside of class, you may turn in work during office hours, or electronically, as described on the assignment sheets. Don't email them.)
Extra Credit: Assignments may include "extra credit" sections. These will enrich your understanding of the material, but at a low points per hour ratio. Do them for the glory, not the points, and don't start extra credit until the basics are complete.
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-2014, the Authors and the Department of Computer Science and Engineering, University of Washington.
Computer Science & Engineering|
University of Washington
Seattle, WA 98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX