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 Fall

Section Class Number Schedule/Time Instructor Location
01 7738 TuTh
2:00 - 3:15 pm
Ouyang,Ming S02-0063
Session: Regular
Class Dates: 09/05/2017
Capacity: 60
Enrolled: 27
Status: Open
Credits: 3/3
Class Notes:
Pre Requisites: Pre-req = CSL 320 or permission of instructor.
Course Attributes:

2018 Spring

Section Class Number Schedule/Time Instructor Location
01 7547 MW
5:30 - 6:45 pm
Offner,Carl D M03-0204A
Session: Regular
Class Dates: 01/22/2018
Capacity: 35
Enrolled: 0
Status: Open
Credits: 3/3
Class Notes:
Pre Requisites: Pre-req = CSL 320 or permission of instructor.
Course Attributes: