Mar 29, 2024  
2008-2009 Graduate Catalog 
    
2008-2009 Graduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

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-andconquer algorithms, and dynamic programming algorithms. Techniques for proving correctness of algorithms.

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

When Offered
II


KSIS Course Search




Add to Portfolio (opens a new window)