CS 442 Analysis of Algorithms

(3)

Prerequisites: CS 252 and MATH 219
How do we design and evaluate effective algorithms? What are the limits of computation? Topics include empirical analysis of algorithms, computational complexity classes, and the following design techniques: brute-force, greedy, divide-and-conquer, recursive, backtracking, and dynamic programming.

Three (3) hours lecture.