CS 4310 - Design and Analysis of Algorithms

A continuation of the study of data structures and algorithms. It provides a theoretical foundation in designing algorithms. The focus is on the advanced analysis of algorithms and on how the selections of different data structures affect the performance of algorithms. Algorithmic paradigms such as divide and conquer, greedy method, dynamic programming, backtracking and branch and bound are covered. B-trees and 2 to 3 search trees and a variety of graph structures are discussed along with their applications to algorithm implementation. Algorithms will be analyzed for their complexity. NP-completeness will be introduced.

Prerequisites & Corequisites: Prerequisite: CS 3310 with a grade of “C” or better, or equivalent.

Credits: 3 hours