3 credits
Fall 2025 Lecture Distance LearningData from last updated 10/3/2025
Fall 2025
Fall 2025 Instructors: ,
Computation models and techniques for the analysis of algorithm complexity. The design and complexity analysis of recursive and non-recursive algorithms for searching, sorting, set operations, graph algorithms, matrix multiplication, polynomial evaluation and FFT calculations. NP-complete problems. Prerequisite: Master's student standing or higher.
Learning Outcomes1Learn computation models and techniques for the analysis of algorithm complexity.
2Learn the design and complexity analysis of recursive and non-recursive algorithms for searching, sorting, set operations, graph algorithms, matrix multiplication, polynomial evaluation and FFT calculations.
3Learn the NP-complete problems.
Restrictions
BoilerCoursesis an unofficial catalog for Purdue courses
made by Purdue students.
made by Purdue students.