Design/analysis of algorithms and data structures; divide-and-conquer; sorting and selection, search trees, hashing, graph algorithms, string matching; probabilistic analysis; randomized algorithms; NP-completeness.
Prereq: 2231 or 321, and 2321 or Math 566, and Stat 3460, 3470, or 427. Concur: Math 3345. Not open to students with credit for 5331 (680).
Credit Hours:
3.0