CPTR 454 Design and Analysis of Algorithms

Application of techniques using asymptotic notations, unit costs, and recurrence relations to the analysis of algorithms. Covers basic design strategies by analyzing and implementing algorithms. Proof-of-correctness methods are presented. Examples of NP-complete and NP-hard problems are discussed. Laboratory work required. Prerequisites: CPTR 143 and MATH 250. Offered odd years only.