CS-254 Algorithm Design and Analysis

(3 cr.)
Repeatable for Credit: No
Introduction to the design and analysis of algorithms. Asymptotic analysis of time complexity. Proofs of correctness. Dynamic programming, greedy algorithms, amortized analysis, and string operations. Concept of NP-completeness.
Prerequisite: take CS-244 & either MATH 154 or MATH 157