Tutorials

The tutorial links below are quite rough and mainly intended as a reminder of what was done in the tutorial. They supplement attending the tutorial, and any code added to the cosc201code repository as a result of the tutorials.

Note: tutorials are not recorded. Note: tutorial titles and links to appropriate review material will be updated after the tutorial depending on what students found the most difficult.

• Tutorial Week 1: There was no tutorial in week 1.
• Tutorial Week 2: Review of big-O and big-Theta based around these notes and problems.
• Tutorial Week 3: Induction problems. Some worked solutions
• Tutorial Week 4: Recurrences, iteration and induction. Some worked solutions
• Tutorial Week 5: Heaps
• Tutorial Week 7: Heaps
• Tutorial Week 9: BSTs and Hashing