CS 432 - Algorithms

Introduces the analysis of algorithms and the effects of data structures on them. Algorithms selected from areas such as sorting, searching, shortest paths, greedy algorithms, backtracking, divide- and-conquer, and dynamic programming. Data structures include heaps and search, splay, and spanning trees. Analysis techniques include asymtotic worst case, expected time, amortized analysis, and reductions between problems. (Y)

Prerequisites & Notes
Prerequisite: CS 216 and 302 with grades of C- or higher.

Credits: 3