Jun 17, 2024  
2010-2011 Undergraduate Academic Catalog | Expires Aug. 2017 
    
Catalog Navigation
  Catalog Home
  Colleges & Departments
  Programs by Department
  Programs
  Courses
  Archived Catalogs
  Undergraduate Admissions
  Advance Credit
  Veterans Educational Benefits
  Residency Classification for Tuition Purposes
  Scholarships and Financial Aid
  Degree Requirements and Registration
  Academic Policies and Regulations
  Tuition and Fees
  Special Programs
  Resources and Services for Students
  My Portfolio
HELP
2010-2011 Undergraduate Academic Catalog | Expires Aug. 2017 THIS CATALOG IS ARCHIVED. BE SURE YOU ARE ACCESSING THE MOST ACCURATE CATALOG FOR YOU.

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Portfolio (opens a new window)

CS 416 - Algorithms and Complexity

This course presents advanced concepts in algorithm analysis. Algorithmic topics include the design and analysis of computer algorithms, divide and conquer techniques, dynamic programming, the greedy method, backtracking, algorithms for sorting and searching, graph computations, pattern matching, and NP-complete problems. Topics in the analysis of algorithms include the fundamentals of the theory of computation and complexity theory, computability, logic, the relationships between complexity classes, NP-completeness, P-completeness, and randomized computation.

Prerequisite: CS 316.

Credits:4 cr


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Portfolio (opens a new window)