Academics

Course Catalog

GRAD > CS > 624

Analysis of Algorithms

Description:
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.

Offered in:

2015 Fall

Section Class Number Weekly Schedule Time Instructor Location
01 5459 TuTh 02:00 PM - 03:15 PM Haspel,Nurit M02-0417 More Info

2016 Spring

Section Class Number Weekly Schedule Time Instructor Location
01 2051 MW 05:30 PM - 06:45 PM Offner,Carl D M01-0212 More Info