Apr 29, 2024  
2012-2013 College of Liberal Arts Catalog 
    
Catalog Navigation
  Catalog Home
  Academic Calendar
  About the College
  Undergraduate Admissions
  Costs
  Financial Assistance

  Departments & Programs
  Major & Minor Requirements
  Course Descriptions

  Administration
  Campus Map
  About Course Listings
  Academic Policies
  My Portfolio
HELP
2012-2013 College of Liberal Arts Catalog [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)