The course is divided into 9 units. These notes are also reachable via the calendar.

• Unit 1 : Big-O
• Unit 2 : Recursion
• Unit 3 : ADTs and LSQs
• Unit 4 : Trees
• Unit 5 : Maps
• Unit 6 : Hash Tables and Ordered Maps
• Unit 7 : Heaps and Priority Queues
• Unit 8 : Graphs
• Unit 9 : Graph Search