|
Syllabus for CSE417: Algorithms and Computational Complexity
|
|
CSE417: Algorithms and Computational Complexity
Credits
3
Catalog 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. NP-complete problems and undecidable problems
Prerequisites
CSE 373.
Textbook(s) and/or other required material
none
Course objectives
none
Topics covered
none
Course structure
none
Last edited by
none
Last modified
(never)
|
 |
Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA 98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX
[comments to webmaint]
|