CS 421 DESIGN AND ANALYSIS OF ALGORITHMS (3-0-3)(F,S) Asymptotic analysis, recurrences, and amortized analysis. Divide-and-conquer, dynamic programming, greedy algorithms and graph algorithms. Primality and other number-theoretic algorithms. Tractability and NP-Completeness. PREREQ: CS 321.