Dec 14, 2018  
2016-2017 HillBook (Class of 2020) 
2016-2017 HillBook (Class of 2020) [ARCHIVED HILL BOOK]

CSC 311 - Algorithms and Complexity

Three Credits
Alternate Years: Spring 2017, 2019

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): CSC 201  and (CSC 211  with a grade of C- or better).