Course Description
CSE 417: Algorithms and Computational Complexity The University of Washington, Seattle, Winter 2013
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. NP-complete problems and undecidable problems.   The teaching methodology combines lectures, in-class exercises, homework problems, and programming projects.