Theoretical Foundations of Computing
Proofs (deductive and inductive reasoning), computability (models of computability and computability issues), and complexity (time and space bounds, nondeterminism, and complexity classification).
C S
611
 Hours3.0 Credit, 3.0 Lecture, 0.0 Lab
 PrerequisitesCS 252 or equivalent; CS 312 or instructor's consent.
 TaughtFall
Course Outcomes: 


Proofs

Prove aspects of critical algorithms