CS 310 - Advanced Algorithmic Analysis

An examination of the formal techniques and underlying mathematical theory behind efficient programming. Topics include asymptotic analysis of complexity bounds for both recursive and iterative algorithms, advanced tree and graph algorithms, fundamental algorithmic strategies (brute-force, greedy, divide-and-conquer, backtracking, branch-and-bound, pattern matching, and numerical approximations), and the implications of non-computability. Recommended for students considering graduate school.

Four credits.

Prerequisite(s): CS 213 or permission of the instructor.