
CSE Home  About Us  Search  Contact Info 

Larry RuzzoMWF 11301220 MEB 246Catalog Description: Design and analysis of algorithms and data structures. Efficient algorithms for manipulating graphs and strings. Fast Fourier Transform. Models of computation, including Turing machines. Time and space complexity. NPcomplete problems and undecidable problems.
Grading: Homework, Midterm, Final, possible programming project. Overall weights very roughly: HW 3045%, midterm 1525%, final 3550%, project 1025%, give or take. Textbooks:
These texts cover quite different components of the material, the Skiena book covers algorithms and NPcompleteness and the Sipser book covers computability and complexity. Both cover NPcompleteness. Short biographies of David Hilbert, Kurt Gödel, Alonzo Church and Alan Turing.
Mailing List: There is a class mailing list. Send an email to
majordomo@cs.washington.edu
with no Subject and with a body that consists of
Midterm Exam: Will be Monday, February 11, 2002. Here is a sample midterm from a previous quarter. Obviously they covered slightly different material that year, so don't take it too literally, but it will give you some idea of the kinds of questions I might ask. All the following are are certainly fair game:
Final Exam: Will be Wednesday, March 20, 2:304:20. Here is a sample final from a previous quarter. As above, they covered slightly different material that year, so don't take it too literally. The exam is comprehensive. In particular, you may have a second chance at some of the kinds of problems that you missed on the midterm, so don't neglect reviewing earlier material. However, there may be a slight bias towards newer stuff:
Portions of the CSE 417 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSE 417 Web: © 19932002, Department of Computer Science and Engineering, University of Washington. 