2019-2020 Undergraduate Catalog 
    
    Oct 25, 2021  
2019-2020 Undergraduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CS 415 Algorithms

An introduction to the theory of computation including Nondeterministic Polynomial-time Problems, Computational intractability, Turing Machines, algorithm analysis, advanced algorithms, and limits of computation. Prerequisite: CS 350  and CS 351  with a grade of “C” or better. 3 hrs



Add to Portfolio (opens a new window)