CS 380 - Algorithm Design and Analysis

4 credit(s)
An introduction to the formal techniques that support the design and analysis of algorithms, focusing on both the underlying mathematical theory and the practical considerations of efficiency. Topics include asymptotic complexity bounds, techniques of analysis, algorithmic strategies, advanced data structures, graph theory and other selected topics. Coursework includes object-oriented programming in C++ and covers templates, STL, and exception handling.
Offered: Alternate years.

Core Requirement(s): Quantitative Reasoning
Prerequisite(s): CS 200 and CS 300 and each with a minimum C grade.