Computer Science 252 - Algorithms

Covers algorithm design techniques (“divide-and-conquer,” dynamic programming, ”greedy” algorithms, etc.), analysis techniques (including big-O notation, recurrence relations), useful data structures (including heaps, search trees, adjacency lists), efficient algorithms for a variety of problems, and NP-completeness. Prerequisites: 212, MTH 111, MTH 153.