CSC 311 - Algorithms and Complexity

Three Credits
Alternate Years: Spring

Basic algorithm techniques: recursion, dynamic programming, greedy method branch and bound. Analysis of algorithms: recurrence equations, NP-completeness, asymptotic complexity. Applications include graph and combinatorial algorithms.

Prerequisite(s)/Restriction(s): CSC 201 and (CSC 211 with a grade of C- or better).
Course Applies to: Data Science