CPTR 430 - Analysis of Algorithms

Credits: 3
An introduction to the design and analysis of advanced algorithms. Topics include asymptotic complexity bounds, graph and tree algorithms, and algorithmic strategies (such as greedy, divide-and-conquer and dynamic programming).

Grade Mode: Normal (A-F,I,W)
Prerequisite(s): CPTR 245 or MATH 355, CPTR 276
Schedule Type: Lecture
College Code: CPS