CSC236H5 • Introduction to the Theory of Computation

Description

Mathematical induction; correctness proofs for iterative and recursive algorithms; recurrence equations and their solutions (including the "Master Theorem"); introduction to automata and formal languages.

Prerequisites
Exclusions
Distribution Requirement
Science
Total Instructional Hours
24L/12T
Mode of Delivery
In Class
Program Area
Computer Science