Jun 26, 2019  
2018-2019 College of Liberal Arts 
    
2018-2019 College of Liberal Arts [ARCHIVED CATALOG]

[Add to Portfolio]

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]