In correspondence with course material, we will approximately follow the plan below for the tutorials. Naturally, depending on the interactions in class, things may progress faster or slower from time to time. Tutorial problems are posted here before the tutorial. To take full advantage of the tutorial hour, study the problems beforehand, and try to solve them on your own. The solutions are posted weekly after the tutorial sections.
| Date | Topic | Problems | Solutions |
| Sept. 17 | Introduction and Simple Induction | ||
| Sept. 24 | Complete Induction and Well Ordering | ||
| Oct. 1 | Structural Induction and Complexity | ||
| Oct. 8 | Complexity - Recursively Defined Functions | ||
| Oct. 15 | Recursively Defined Functions (Continued) - Master Theorem | ||
| Oct. 22 | Divide and Conquer Algorithms | ||
| Oct. 29 | Program Correctness (Recursive Programs) | ||
| Nov. 5 | Program Correctness (Iterative Programs) | ||
| Nov. 12 | Termination and Introduction to Formal Language Theory (Finite Automata) | ||
| Nov. 19 | Regular Languages and Their Properties | ||
| Nov. 26 | Regular Expressions and NFAs | ||
| Dec. 3 | Equivalence of Notions of Regularity |
This session has two tutorial times. Below are the information for the tutorials
Thursdays at 8 pm (BA1170)
Thursdays at 8 pm (BA2185)