CSC 332 Design and Analysis of Algorithms
An introduction to the theoretical and empirical evaluation of algorithms and to some fundamental concepts in algorithm design and implementation. Topics include worst-case vs. average-case performance, complexity classes, recurrence relations, problem-solving strategies, heuristics, and NP-complete problems.
Prerequisite
CSC 223 with a grade of C- or higher, and
MAT 200 or
MAT 300, or permission of the instructor.