CSC236H1: 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…
Independent study archive Learn more
Materials are uploaded by users for self-study purposes. PwnHero is an independent platform, not affiliated with, sponsored by, or endorsed by any university or institution.
Common aliases: CSC236H1
Study Resources for Introduction to the Theory of Computation
Midterm (Exam 1) 2017
Midterm (Exam 2) 2017
Final Exam 2015
Midterm (Exam 1) 2018
Midterm (Exam 2) 2018
Midterm (Exam 1) 2019
Midterm (Exam 2) 2019
Midterm (Exam 1) 2020
Midterm (Exam 2) 2020
Study Guide 2
Quiz 2
Assessment Inventory for CSC236H1 (11 Documents)
| Document | Format | Year | Access |
|---|---|---|---|
| Midterm (Exam 1) 2020 | Midterm | 2020 | Illustrative Archive |
| Midterm (Exam 2) 2020 | Midterm | 2020 | Illustrative Archive |
| Midterm (Exam 1) 2019 | Midterm | 2019 | Illustrative Archive |
| Midterm (Exam 2) 2019 | Midterm | 2019 | Illustrative Archive |
| Midterm (Exam 1) 2018 | Midterm | 2018 | Illustrative Archive |
| Midterm (Exam 2) 2018 | Midterm | 2018 | Illustrative Archive |
| Midterm (Exam 1) 2017 | Midterm | 2017 | Illustrative Archive |
| Midterm (Exam 2) 2017 | Midterm | 2017 | Illustrative Archive |
| Final Exam 2015 | Final | 2015 | Illustrative Archive |
| Study Guide 2 | Study Guide | — | Illustrative Archive |
| Quiz 2 | Quiz | — | Illustrative Archive |
Complete inventory of all 11 assessments (sorted by most recent). Select any document to inspect or use the search bar above to filter.
Course Overview & Exam Syllabus
Course Description
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 . Very strong students who already have this experience (e.g. successful completion of MAT157Y1 ) may consult the undergraduate office about proceeding directly into CSC236H1 or CSC240H1 .
This archive catalogs 11 free educational resources and past exams for CSC236H1 (Introduction to the Theory of Computation) at University of Toronto (U of T), containing 8 midterm papers, 1 final examination, 1 quiz, and 1 study guide. Dated documents represent 5 distinct academic years between 2015 and 2020.
Core Exam Topics & Learning Objectives
- Algorithmic design paradigms: divide-and-conquer, greedy optimization, and dynamic programming in CSC236H1
- Network flow, bipartite matching, and polynomial-time reductions (NP-completeness proofs)
- Graph algorithms: Dijkstra, Bellman-Ford, Prim, Kruskal, and topological sorting in Introduction to the Theory of Computation
- Amortized analysis, randomized algorithms, and recurrence relation solutions via the Master Theorem
Frequently Asked Questions
Which assessment formats are cataloged in this CSC236H1 archive?
This collection for CSC236H1 at University of Toronto (U of T) catalogs 11 total resources across the following formats: Midterms, Finals, Quizzes, Study Guides. Each document is listed in the assessment inventory table with its individual format tag and academic year where recorded.
What academic years are covered in this CSC236H1 collection?
Dated materials in this archive span from 2015 to 2020, representing 5 distinct academic years. Coverage varies by the records currently cataloged for this course.
How can students access these free CSC236H1 past exams?
All cataloged CSC236H1 past exams and study materials are free to request. The catalog, metadata, assessment inventory, and illustrative thumbnails are public; source documents are not shown on this page. Use the connect options to request a study resource, and confirm current course topics and grading policies with the University of Toronto (U of T) course syllabus.