Mathematical induction with emphasis on applications relevant to computer science. Aspects of mathematical logic, correctness proofs for iterative and recursive algorithms, solutions of linear and divide-and-conquer recurrences, introduction to automata and formal languages.
Prerequisite:
Exclusion:
CSC236H, CSC240H
Breadth Requirements:
Quantitative Reasoning