Introduction to the Design and Analysis of Algorithms
Algorithm design techniques: dynamic programming, greedy algorithms, Euclidean and extended Euclidean algorithms, Discrete and Fast Fourier transforms. Analysis of algorithms, intractable problems and NP-completeness. Additional topics selected from: selection algorithms and adversary arguments, approximation algorithms, parallel algorithms, and randomized algorithms. Prerequisite: CS 146 (with a grade of "C-" or better) or instructor consent.
Normal Grade Rules