Overview
Correctness and efficiency of algorithms. Computational complexity: time and space bounds. Techniques for best-case, worst-case and average-case time and space analysis. Designing algorithms using induction, divide-and-conquer and greedy strategies. Algorithms: sorting and order statistics, trees, graphs, matrices. Intractability: classes P, NP, and NP-completeness, approximation algorithms.
Conditions for Enrolment
Prerequisite: COMP1927 or COMP2521
Delivery
Fully online - Standard (usually weekly or fortnightly)
In-person - Standard (usually weekly or fortnightly)
Course Outline
To access course outline please visit below link (Please note that access to UNSW Canberra course outlines requires VPN):
Fees
Type | Amount |
---|---|
Commonwealth Supported Students (if applicable) | $994 |
Domestic Students | $5970 |
International Students | $5970 |
Pre-2019 Handbook Editions
Access past handbook editions (2018 and prior)