CSC236: Introduction to the Theory of Computation
Prerequisite: CSC148, MAT102
Check out the past exams!
What is CSC236?
CSC236 is a course that focuses on proving the correctness and the runtime of both iterative and recursive algorithms.
After this course, students will have mastered the different types of induction and use them to prove both the correctness and the runtime of algorithms.
Topics in CSC236
- Induction (Complete and Structural)
- Runtime analysis
- Recursion
- Mastery Theorem
- Program Correctness
- Regular Languages
- Deterministic finite automaton
- Nondeterministic finite automaton