Jan 23, 2020  
2013-2014 Graduate Catalog 
    
2013-2014 Graduate Catalog Archived Catalog

[Add to Portfolio]

CPSC 5200 - Automata, Complexity, and Computability


(3) Credit Hours

An introduction to the classical and contemporary theory of computation including automata, formal languages, Turing machines, recursive functions, computability and uncomputability, complexity and the classes of P and NP. Prerequisite: Department Head approval. Differential Course Fee will be assessed
3.000 Credit hours
3.000 Lecture hours

Levels: Graduate
Schedule Types: Face-to-Face Classroom Instruc, Blended/Hybrid (30-79% Web), Internet (80%> Web Based), Lecture, Video Streaming/Interactive, Web-Enhanced (29%< Web Based)

Computer Science and Engr Department

Course Attributes:
CECS Differential Course Fee, Repeatable Course
 



[Add to Portfolio]