Mar 29, 2024  
2014-2015 Undergraduate and Graduate Academic Catalog 
    
2014-2015 Undergraduate and Graduate Academic Catalog [ARCHIVED CATALOG]

Add to Catalog (opens a new window)

CMPS 406 - Fundamentals of Computing Theory


3 Credit(s). 0 Hour(s) Lab. 3 Hour(s) Lecture.

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.

Prereq: CMPS 150  and CMPS 341 .
Coreq: CMPS 405 .



Add to Catalog (opens a new window)