University of Cincinnati Logo
 

20-CS-472 - Analysis of Algorithms II
Electrical Engineering and Computing Systems

Instructor

John Franco

Registration Data

Credit Level: U. Credit Hrs: 3.00.
Prerequisites: 20-CS-471

Logistics

Course Description

Further introduction to the study of algorithms. Analysis of computing time, asymptotic notation and generating functions. Strategies for designing algorithms: Divide-and-conquer, Greedy method, Backtracking, etc. Further topics such as techniques for algebraic manipulations, lower and upper bound theory, NP-Complete problems, and parallel algorithms.

Keywords

Divide-and-Conquer, Greedy Algorithm, matroids, backtracking, Branch-and-Bound, Stochastic Local Search, complexity classes, NP-complete, NP, P, logic algorithms, Binary Decision Diagrams, probabilistic algorithm, lower bounds, upper bounds, probabilistic analysis.

Addendum

ERC
MainStreet
Paul Erdos
NIT
Ladies on Campus
Oscar Robinson