Algorithms

In 2021 (semester 2) I was the second examiner of the Algorithms course (COMP3600 / COMP6466), convened by Hanna Kurniawati. I taught weeks 6 to 8. In 2023 I was the co-convenor, with main convenor Ahad N. Zehmakan. I taught the same weeks again, plus the last on complexity theory (the slides of which I created from scratch).

I provide only the slides that I created for the 2023 version.

• week 6:

  • Data Structures: Binary Search Trees (Slides (handout) (single))

  • Data Structures: Heaps (Slides (handout) (single))

  • Data Structures: AVL Trees (Slides (handout) (single))

• week 7: Data Structures: Red/Black Trees (Slides (handout) (single))

• week 8: Data Structures: Hash Tables (Slides (handout) (single))

• week 12: Complexity Theory (Slides (handout) (single)) Note that a newer (and hence slightly improved) version of this week can be found in the Foundations of Computing course 2024 (also week 12).

List of topics for the other weeks can be taken from the class summary.