CS 8045: Advanced Design and Analysis of Algorithms

3 Credit Hours
Prerequisite: Admission to Computer Science Ph.D. Program, Computer Science M.S. Program, or Analytics and Data Science Ph.D. Program
This course covers topics related to design and analysis of algorithms including divide-and-conquer, greedy method, dynamic programming, recursive algorithms, approximation algorithms, lower- and upper-bound studies, parallel algorithms, time and space complexity of algorithms, and NP-hard and NP-complete problems.