Analysis of Algorithms
Course #: CS 624
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.
Pre Requisites: Pre-requisite: CS 220 or permission of instructor
Offered in:
2026 Fall
| Section | Class Number | Schedule/Time | Instructor | Location | |
|---|---|---|---|---|---|
| 01 | 2612 | MW 5:30 - 6:45 pm |
Haspel,Nurit | University Hall Y04-4140 | |
|
Session:
Regular
Class Dates:
09/08/2026 - 12/11/2026
Capacity:
30
Enrolled:
3
Status:
Open
Credits:
3/3
Class Notes:
Pre Requisites:
Pre-requisite: CS 220 or permission of instructor
Course Attributes:
|
|||||
2026 Spring
| Section | Class Number | Schedule/Time | Instructor | Location | |
|---|---|---|---|---|---|
| 01 | 6728 | TuTh 2:00 - 3:15 pm |
Haspel,Nurit | McCormack M02-0417 | |
|
Session:
Regular
Class Dates:
01/26/2026 - 05/13/2026
Capacity:
24
Enrolled:
14
Status:
Open
Credits:
3/3
Class Notes:
Pre Requisites:
Pre-requisite: CS 220 or permission of instructor
Course Attributes:
|
|||||