Advanced Algorithms

Undergraduate | 2026

Course page banner
area/catalogue icon
Area/Catalogue
COMP 4012
Course ID icon
Course ID
205818
Level of study
Level of study
Undergraduate
Unit value icon
Unit value
6
Course level icon
Course level
4
Study abroad and student exchange icon
Inbound study abroad and exchange
Inbound study abroad and exchange
The fee you pay will depend on the number and type of courses you study.
No
University-wide elective icon
University-wide elective course
No
Single course enrollment
Single course enrolment
No
alt
Note:
Course data is interim and subject to change

Course overview

The development of a sound theoretical understanding of advanced algorithms and practical problem solving skills using them. Advanced algorithm topics chosen from: Dynamic Programming, Linear Programming, Matching, Max Flow / Min Cut, P and NP, Approximation Algorithms, Randomized Algorithms, Computational Geometry.

Course learning outcomes

  • Develop a sound theoretical understanding of advanced algorithms and practical problem solving skills using them.
  • Develop basic knowledge of a wide range of advanced algorithm design techniques including dynamic programming, linear programming, approximation algorithms, and randomised algorithms.
  • Develop basic advanced algorithm analysis skills for analysing the approximation ratio of approximation algorithms and the probability of randomised algorithms.
  • Explain a wide range of advanced algorithmic problems, their relations and variants, and application to real-world problems.

Prerequisite(s)

N/A

Corequisite(s)

N/A

Antirequisite(s)

N/A