Course Listings

all > GRAD > cs > cs 624

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:

2023 Fall

Section Class Number Schedule/Time Instructor Location
01 2937 MW
5:30 - 6:45 pm
Haspel,Nurit University Hall Y02-2310
Session: Regular
Class Dates: 09/05/2023 - 12/13/2023
Capacity: 50
Enrolled: 47
Status: Open
Credits: 3/3
Class Notes:
Pre Requisites: Pre-requisite: CS 220 or permission of instructor
Course Attributes:

2024 Fall

Section Class Number Schedule/Time Instructor Location
01 2845 MW
5:30 - 6:45 pm
Haspel,Nurit McCormack M02-0116
Session: Regular
Class Dates: 09/03/2024 - 12/13/2024
Capacity: 50
Enrolled: 23
Status: Open
Credits: 3/3
Class Notes:
Pre Requisites: Pre-requisite: CS 220 or permission of instructor
Course Attributes:

2024 Spring

Section Class Number Schedule/Time Instructor Location
01 9136 TuTh
5:30 - 6:45 pm
Culpepper,Ryan McCormack M03-0617
Session: Regular
Class Dates: 01/22/2024 - 05/08/2024
Capacity: 30
Enrolled: 23
Status: Open
Credits: 3/3
Class Notes:
Pre Requisites: Pre-requisite: CS 220 or permission of instructor
Course Attributes: