|CSE Home||About Us||Search||Contact Info|
Course Email: firstname.lastname@example.org. Use this list to ask and/or answer questions about homework, lectures, etc. The instructor and TA are subscribed to this list. All messages are automatically archived. Questions not of general interest may be directed to the instructor and/or TA. You can (and perhaps should) change your subscription options.
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, Midterm, Final. Homework will be a mix of paper & pencil exercises and programing. Overall weights very roughly: HW 55%, midterm 15%, final 30%.
Late Policy: Unless otherwise announced, papers and/or electronic turnins are due by 4:00PM on the due date. 10% off for up to one day late (business day, e.g., Monday for Friday due dates); additional 20% per day thereafter.
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-2007, 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