CS 324 Design and Analysis of Algorithms
Topics include: analysis of algorithms; dynamic programming; probabilistic algorithms, examples of geometric, combinatorial, and graph algorithms, pattern matching; introduction to NP-completeness. Prerequisite: CS 121 and either CS 124 or MATH 215 and either MATH 161 or 165, all with C- or better grades.