| |
Dec 07, 2025
|
|
|
|
|
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-andconquer algorithms, and dynamic programming algorithms. Techniques for proving correctness of algorithms.
Requisites:
Pr.: CIS 300, CIS 301, and MATH 510.
When Offered:
Spring
Add to Portfolio (opens a new window)
|
|
