Dec 26, 2024  
2022-2023 Undergraduate Catalog 
    
Catalog Navigation
  Catalog Home
  Archived Catalogs
  Academic Calendar for 2022-2023
  About the University
  Administration and Governance
  Admission to the University
  Academic Policies and Procedures
  Volunteer Core Requirements
  General Education Requirements for 2021-2022 or earlier
  Degrees, Majors, Concentrations, Minors, Certificates
  Accelerated Combined Bachelor’s/Master’s Programs
  Distance Education (DE) Programs
  Majors, A-Z
  Minors, A-Z
  Course Descriptions
  Exploratory Students
  Herbert College of Agriculture
  College of Architecture and Design
  College of Arts and Sciences
  Haslam College of Business
  College of Communication and Information
  College of Education, Health, and Human Sciences
  Tickle College of Engineering
  College of Nursing
  College of Social Work
  Intercollegiate
  Center for Global Engagement
  Honors and Scholars Programs
  Howard H. Baker Jr. Center for Public Policy
  Reserve Officers Training Corps (ROTC)
  University Libraries
  University Studies
  University Transition Program
  Glossary
  Catalog User Guide-1
  My Portfolio
HELP
2022-2023 Undergraduate Catalog [ARCHIVED CATALOG]

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Portfolio (opens a new window)

COSC 482 - Theory of Computation

3 Credit Hours
Properties of finite automata/regular sets and push-down automata/context-free languages. Countability, diagonalization, and undecidability. Complexity, including the classes P and NP, NP-completeness, and reduction techniques.

(RE) Prerequisite(s): COSC 312  with a grade of C or better.


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Portfolio (opens a new window)