C S 504 - Design and Analysis of Algorithms

Correctness of algorithms. Analysis of efficiency of algorithms—recurrence relations, worst-case and best-case behavior, average-case behavior. Design of algorithms: divide-and-conquer and balancing, greedy method, graph searching, dynamic programming, backtracking, branch-and-bound and preprocessing techniques.

Prerequisites
Prereq: MSCS major or 561N.

Credits: (4)
When Offered
(fall, winter)

Ohio University

Ohio University

C S 504 - Design and Analysis of Algorithms