CSC236H5 • Introduction to the Theory of Computation
Mathematical induction; correctness proofs for iterative and recursive algorithms; recurrence equations and their solutions (including the "Master Theorem"); introduction to automata and formal languages.
(60% or higher in CSC111H5)or((60% or higher inCSC148H5) and (60% or higher in MAT102H5))
Priority is given to students enrolled in Computer Science Specialist, Information Security Specialist, Computer Science Major or Computer Science minor programs.
