CPSY 4000 - Algorithms

Description
This course focuses on the fundamentals of algorithms and software optimization. Special attention will be paid to algorithm applicability and measures of complexity for time and space, as well as worst-case, average-case, and best-case analysis. You will also examine P and NP classes, NP-hardness, NP-completeness, and lower and upper bounds of algorithms, including using comparison trees, adversary arguments and reduction. You will also be introduced to parallel computational models and algorithms.

3 Credits

Prerequisites

DATA 3000