May 05, 2024  
2014-2015 College of Liberal Arts Catalog (Admitted Fall 2014/Spring 2015) 
    
Catalog Navigation
  Catalog Home
  About the College
  Academic Calendar
  Academic Policies
  General Education Requirements

  Departments & Programs
  Major & Minor Requirements
  Course Descriptions
  About Course Listings

  Administration
  Academic Calendar
  Campus Map

  Undergraduate Admissions
  Costs
  Financial Assistance
  My Portfolio
HELP
2014-2015 College of Liberal Arts Catalog (Admitted Fall 2014/Spring 2015) [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CSCI 370 - Algorithm Analysis and Computability

4 credits
Methods for the analysis of time and space efficiency, comparison of brute-force algorithms with divide-and-conquer algorithms, tree algorithms, graph algorithms, string algorithms, dynamic programming, and greedy methods. An introduction to NP-completeness and intractability. Turing machines, Church’s thesis, determinism and non-determinism, unsolvability and reducibility. Search and constraint satisfaction. Meets: weekly for three 65-minute periods. Prerequisite: C- or better in CSCI 230  and C- or better in CSCI 220 . Offered spring semester.


Add to Portfolio (opens a new window)