CS 58000 - Algorithm Design, Analysis, And Implementation

Basic techniques for designing and analyzing algorithms: dynamic programming, divide and conquer, balancing. Upper and lower bounds on time and space costs, worst case and expected cost measures. A selection of applications such as disjoint set union/find, graph algorithms, search trees, pattern matching. The polynomial complexity classes P, NP, and co-NP; intractable problems.

Preparation for Course
P: CS 48600 or Permission of Instructor.

Cr. 3.