Skip to main content
Department:
>
Course:
Theoretical Fndtns of Computng
C S
611

Theoretical Fndtns of Computng

Hours

3.0 Credit, 3 Lecture, 0 Lab

Semester

Fall
Proofs (deductive and inductive reasoning), computability (models of computability and computability issues), and complexity (time and space bounds, nondeterminism, and complexity classification).

Proofs

Prove aspects of critical algorithms