CSCB63 Fall 2020

Tutorial: Wednesday 11-1

• Tutorial 1 - Asymptotic Notation
• Tutorial 2 - Insertion Sort
• Tutorial 3 - Using Limits to Prove/Disprove Big-O, AVL Trees
• Tutorial 4 - AVL Delete, AVL Augmenting
• Tutorial 5 - Adjacency Lists, Breadth-First Search (BFS), Depth-First Search (DFS)
• Tutorial 7 - Prim's Algorithm, Adjacency Matrices
• Tutorial 8 - Probability