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

  Departments & Programs
  Major & Minor Requirements
  Combined Degree & Special Programs
  Course Descriptions
  About Course Listings

  Administration
  Campus Map

  Undergraduate Admissions
  Costs
  Financial Assistance
  My Portfolio
HELP
2019-2020 College of Liberal Arts (Admitted Fall 2019/Spring 2020) [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. Prerequisite: C- or better in MATH 220  and CSCI 230  .  Offered every Spring.


Add to Portfolio (opens a new window)