DESCRIPTION
Measuring algorithmic complexity (ONotation); searching and sorting algorithms and their complexity; tree and graph algorithms and their complexity; classes of algorithms, such as divide-andconquer, backtracking, greedy, probabilistic, etc. Computational complexity; the classes P and NP.
Prereq.: CSc 21200 and [CSc 21700 or EE 31100]. 3 hr./wk.; 3 cr.
Last Updated: 07/30/2015 08:02