Apr 27, 2024  
2018-2019 Hill Book (Class of 2022) 
    
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
  Financial Information and Scholarships
  College Legal Notices
  Faculty and Staff Listing
  Archived HillBook Catalogs
HELP
2018-2019 Hill Book (Class of 2022) [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 2019, 2021

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


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