HomeAcademicsCourses → CS624

Analysis of Algorithms (3 credits)

Basic techniques for designing algorithms: divide and conquer, the greedy method, dynamic programming, etc. Applications to searching and sorting algorithms. Complexity of parsing. The fast Fourier transform and its applications (evaluation of polynomials and arithmetical problems). Lower bound theory. NP-hard and NP-complete problems. Probabilistic estimates of algorithms.

Pre-requisites

CS320L or permission of the instructor.


This page was last modified on January 18, 2014
© 2014 University of Massachusetts Boston

Template by OS Templates