CS624: Analysis of Algorithms
Credits: 3
Catalog 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.
Current & Upcoming Offerings
2025-2026
Fall 2025 1 section
| Section | Schedule / Time | Instructor | Location |
|---|---|---|---|
| 01 |
MW 05:30PM - 06:45PM
|
Haspel, Nurit |
W01-0004
|
Spring 2026 1 section
| Section | Schedule / Time | Instructor | Location |
|---|---|---|---|
| 01 |
TuTh 02:00PM - 03:15PM
|
Haspel, Nurit |
M02-0417
|
Prerequisites
- CS220/CS320L/MATH320L
- Permission of the instructor
Graduate course in analysis of algorithms for graduate students covering algorithms, abstract data types, and complexity analysis.