CIS 575 - Introduction to Algorithm AnalysisCredits: 3
An introduction to mathematical analysis of time- and space-complexity of algorithms, including worst-case, average-case, and amortized complexity. An examination of various algorithmic designs, such as greedy algorithms, divide-and-conquer algorithms, and dynamic programming algorithms. Techniques for proving correctness of algorithms.
Prerequisite: CIS 300, CIS 301, and MATH 510.
Empirical and Quantitative Reasoning
View course scheduling information for Summer 2017, if available.
View course scheduling information for Fall 2017, if available.
[Add to Portfolio]