Computer Science
CS 7800: Advanced Algorithms
Lecture - 4 credits
ND
EI
IC
FQ
SI
AD
DD
ER
WF
WD
WI
EX
CE
- 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.
Presents advanced mathematical techniques for designing and analyzing computer algorithms. Show more.