Sep 24, 2024  
2011-2012 HillBook (Class of 2015) 
    
2011-2012 HillBook (Class of 2015) [ARCHIVED HILL BOOK]

CSC 311 - Algorithms and Complexity

Three Credits
Alternate Years: Fall 2012, 2014

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 .