Dec 27, 2024  
2024-2025 Undergraduate and Graduate Catalog 
    
2024-2025 Undergraduate and Graduate Catalog
Add to Catalog (opens a new window)

CMPS 406 - Fundamentals of Computing Theory

Credit Hours: 3
Lecture Contact Hours: 3 Lab Contact Hours: 0
Review of mathematical background. Algorithmic problems and their solutions. Methodology for algorithmic problem solving, abstraction and design; case study. Basics of program correctness and complexity analysis. A matriculation course for graduate students in computer science and engineering lacking computer science background. No credit toward any computer science or computer engineering degree.

Prerequisite(s): CMPS 150  and CMPS 341 

Corequisite(s): CMPS 405 



Add to Catalog (opens a new window)