CSE 417
Algorithms and Computational Complexity
Credits
3.0
Lead Instructor
Steven Tanimoto
Textbook
- Algorithm Design, Kleinberg
Course 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. Intended for non-majors.
Prerequisites
CSE 373.
CE Major Status
None
Course Objectives
none
ABET Outcomes
No outcomes registered
Course Topics