Catalog Entries |
Spring 2017 Semester
Mar 24, 2023 |
|
 |
||
 | Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
| CS 7800 - Advanced Algorithms |
|
Presents advanced mathematical techniques for designing and analyzing computer algorithms. Reviews some of the material covered in CS 5800 and then covers advanced topics. Emphasizes theoretical underpinnings of techniques used to solve problems arising in diverse domains. Topics include asymptotic analysis, advanced data structures, dynamic programming, greedy algorithms and matroid theory, amortized analysis, randomization, string matching, algebraic algorithms, and approximation algorithms. Introduces Turing machines, P and NP classes, polynomial-time reducibility, and NP completeness. Prereq. Computer science PhD students only.
4.000 Credit hours 4.000 Lecture hours Levels: Graduate Schedule Types: Lecture Computer Science Department Course Attributes: GSCS Computer & Info Science |
|