Sep 27, 2024  
2014-2015 HillBook (Class of 2018) 
    
Catalog Navigation
  Hill Book Home
  Mission and History
  Academic Life & the Curriculum
  Academic Partnerships & Resources
  International and Experiential Learning Programs
  Academic Policies and Procedures
  The Cornerstone Program of General Education
  Programs of Study
  Course Descriptions
  Admission Requirements
  Financial Information and Scholarships
  Faculty and Staff Listing
  Archived Catalogs
  Archived HillBooks
HELP
2014-2015 HillBook (Class of 2018) [ARCHIVED HILL BOOK]

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)

CSC 311 - Algorithms and Complexity

Three Credits
Alternate Years: Spring 2015, 2017

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).


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)