CSC 22000 Algorithms

Measuring algorithmic complexity (O-Notation); searching and sorting algorithms and their complexity; tree and graph algorithms and their complexity; classes of algorithms, such as divide-and-conquer, backtracking, greedy, probabilistic, etc. Computational complexity; the classes P and NP.

Credits

3

Prerequisite

CSC 21200.

Contact Hours

3 hr./wk.