Analysis of Algorithms
Course #: CS 624, Class #: 6728, Section #: 01
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.
Prerequisites
CS 220 or permission of instructor
Course Details
Date / Time
1/26/26 - 5/13/26
TuTh 2p.m. – 3:15p.m.
Location
McCormack M02-0417
Credits
3
Session
Regular Academic Session
Class Dates
1/26/2026 - 5/13/2026
Location
McCormack M02-0417
Enrolled / Capacity
14 / 24
Status
Open