MAT 4880 - Design and Analysis of Algorithms

(3-0-3) Design paradigms of algorithms such as brute-force, exhaustive search, divide-and-conquer, backtracking, greedy approach and dynamic programming. Mathematical analysis of algorithms; P, NP, and NP-complete problems; heuristics, approximation algorithms, optimality.


Prerequisites & Notes
MAT 3870 or permission of instructor.


Credits: 3
Print-Friendly Page (opens a new window)
Close Window