Algorithms

Catalog description

This course covers the implementation and analysis of fundamental algorithms, techniques to analyze the asymptotic performance of algorithms for cases (worst, best, and average) and bounds (upper bounds, lower bounds, and both upper and lower bounds), common algorithms strategies, such as dynamic programming, divide-and-conquer, and greedy, algorithms related to graph theory and NP-complete problems and proofs. Components: Class Prereqs/Coreqs: P: COMPUTER 2630 with a C- or better Typically Offered: Spring