Description:

CS5114: Methods for constructing and analyzing algorithms. Measures of computational complexity, determination of efficient algorithms for a variety of problems such as searching, sorting and pattern matching. Geometric algorithms, mathematical algorithms, and theory of NP-completeness.

See: course pages.

Taught By: Lenwood Heath
Cliff Shaffer
T. M. Murali
Anil Vullikanti