CSCI 211 - Algorithm Design and Analysis

Credits: 3

Prerequisite: CSCI 112 and either MATH 121, MATH 201, or MATH 225. 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.