CS 580 - 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: 482 and 484, or 486 and 488.

Cr. 3.
Dual Level Course
Dual Level, Undergraduate-Graduate