CSC236 Introduction to the Theory of Computation

The application of logic and proof techniques to Computer Science. Mathematical induction; correctness proofs for iterative and recursive algorithms; recurrence equations and their solutions; introduction to automata and formal languages. This course assumes university-level experience with proof techniques and algorithmic complexity as provided by CSC165H1

Course textbook

Lecture Slides

1. Week 1
2. Week 2
3. Week 3
4. Week 4
5. Week 5
6. Week 6
7. Week 7
8. Week 8
9. Week 9
10. Week 10
11. Week 11
12. Week 12

Assignments

1. • Handout
   • I wrote
   • Solution
2. • Handout
   • I wrote
   • Solution
3. • Handout
   • I wrote
   • Solution

Reflection ✍

Overall:3.5/5, Workload 3.5/5, Difficulity 4/5

Semi difficult. Just a continuation of 165. DFA/NFAs are interesting