COMP 4500 - Algorithm Design and Analysis

Hours: 3
Formal techniques for the analysis of algorithmic complexity, both space and time. Algorithm design techniques, such as brute force, divide and conquer, dynamic programming, backtracking, etc., are explored. Advanced algorithms and data structures are introduced. The concept of computational complexity is introduced along with NP-completeness.
SP Sem, every other year, even years.
Prerequisites: COMP 2100 and 2230.

About Otterbein

Apply to Otterbein

Campus Life

On Campus

Contact Otterbein

COMP 4500 - Algorithm Design and Analysis