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:

2017 Spring

Section Class Number Schedule/Time Instructor Location
01 1874 MW
17:30 - 18:45
Offner,Carl D M03-0617
Session: Regular
Class Dates: 01/23/2017
Capacity: 35
Enrolled: 35
Status: Closed
Credits: 3/3
Class Notes:
Pre Requisites: Pre-req = CSL 320 or permission of instructor.
Course Attributes:
50C 14117 MW
17:30 - 18:45
Offner,Carl D M03-0617
Session: CE Ses 2
Class Dates: 01/23/2017
Capacity: 2
Enrolled: 0
Status: Open
Credits: 3/3
Class Notes:
Pre Requisites: Pre-req = CSL 320 or permission of instructor.
Course Attributes: