COMP 4500 - Algorithm Design and Analysis

Hours: 4
Lecture and Laboratory. Introduces 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 discussed by way of the theory of NP-completeness.

Prerequisites: COMP 2100 and MATH 1700.

Print this Page

About Otterbein

Apply to Otterbein

Campus Life

On Campus

Contact Otterbein

COMP 4500 - Algorithm Design and Analysis