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:
• Tutorial Week 2: Induction problems.
• Tutorial Week 3: Induction, big O, big Theta. Some worked solutions.
• Tutorial Week 4: Induction again. Some worked solutions.
• Tutorial Week 5: Iteration, substitution and induction
• Tutorial Week 7: BSTs and Hashing
• Tutorial Week 8: Data Structure Choice
• Tutorial Week 9: No tutorial this week.
• Tutorial Week 10: Graph Algorithms
• Tutorial Week 11: Greedy Algorithms and Dynamic Programming –>
• Tutorial Week 12: