CS 5800: Algorithms
Lecture - 4 credits
- Presents the mathematical techniques used for the design and analysis of computer algorithms.
- Focuses on algorithmic design paradigms and techniques for analyzing the correctness, time, and space complexity of algorithms.
- Topics may include asymptotic notation, recurrences, loop invariants, Hoare triples, sorting and searching, advanced data structures, lower bounds, hashing, greedy algorithms, dynamic programming, graph algorithms, and NP-completeness.
Presents the mathematical techniques used for the design and analysis of computer algorithms. Show more.