CSCI 211 - Algorithm Design and Analysis

Prerequisite: CSCI 112 and either MATH 121 or MATH 225
Credits: 3

Methods for designing efficient algorithms, including divide-and-conquer, dynamic programming, and greedy algorithms. Analysis of algorithms for correctness and estimating running time and space requirements. Topics include advanced data structures, graph theory, network flow, and computational intractability.