Algorithms and Complexity

Postgraduate compulsory subject, School of Computing and Information Systems, The University of Melbourne, 2018

COMP90038 is a mandatory postgraduate subject covering algorithm design, analysis, and complexity theory. Topics include sorting and searching, graph algorithms, dynamic programming, greedy algorithms, and NP-completeness.

Role

  • Coordinator and Lecturer of twelve sessions (S2/2018–2019, ~350 students per session)
  • Co-taught with A.Prof. Toby Murray, supported by a team of ten tutors

Highlights

  • Used active learning and peer-instruction techniques to engage a large cohort
  • Student evaluation averaged 4.03/5.00 across the two years