[General boards] [Fall 2018 courses] [Summer 2018 courses] [Winter 2018 courses] [Older or newer terms]

CSC236H1: Introduction to Theory of Computation

About the CSC236H1: Introduction to Theory of Computation category (1)
Closure property (2)
Characteristic Equation with Non-Distinct Roots (1)
Will we be tested on recursive enumerable languages? (1)
State removal and subset construction (3)
Are we allowed a cheat sheet? (2)
Do we need to write the forml proof of equivalence of regex, DFA, NFA in exam? (3)
Will we have to prove loop invariants outside of correctness? (2)
Prove L(NFA) = L(DFA) = L(RegExp) (1)
Aid sheet for final exam (2)
Problem Set 3 (3)
PS3 Q1 Is an empty list a continguous sublist? (2)
Ps3 q2 (2)
Tips for PS3 Q3 (3)
Ps3 q1 (2)
Problem Set 3 Question 2 (2)
Quiz 2 topic? (2)
Where is today's office hour being held? (2)
Tutorial 6 and measure that increases for iterative correctness (1)
What will quiz 2 cover? (1)
What time of the office hour today? I come to ba3219 but no one there (8)
What topics will be covered on Quiz 2 (1)
Ps2 q4 p3 (3)
Is this also a divide-conquer recurr algorithm? (3)
Question for Q1 part3 (8)
Minimum divide and conquer closed form (1)
PS2Q3P3 Floor and Ceiling Question (5)
Can anyone tell me what 'Devise an algorithm for minimum' means? (3)
Knapsack Problem Constraint Boundaries (4)
Ps2q2 (3)