CS 6161
Design and Analysis of Algorithms
Course Description
Analyzes concepts in algorithm design, problem solving strategies, proof techniques, complexity analysis, upper and lower bounds, sorting and searching, graph algorithms, geometric algorithms, probabilistic algorithms, intractability and NP-completeness, transformations, and approximation algorithms.
Instructors
No instructors this semester
This course isn't being taught this semester. Try viewing the last 5 years.