CIS 575 - Introduction to Algorithm Analysis

Credits: (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.

Requisites
Pr.: CIS 300, CIS 301, and MATH 510.

When Offered
II

Print-Friendly Page

Add to Catalog Portfolio.

Close Window