Overview

Techniques for design and performance analysis of algorithms for a variety of computational problems. Asymptotic notations, bounding summations, recurrences, best-case, worst-case and average-case analysis. Design techniques: divide-and-conquer, dynamic programming and memorisation, greedy strategy, backtracking, branch-and-bound. Algorithms: sorting and order statistics, trees, graphs and flow networks, matrices, arithmetic circuits. Intractability: classes … For more content click the Read More button below.

Conditions for Enrolment

Prerequisite: COMP9024.

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

Pre-2019 Handbook Editions

Access past handbook editions (2018 and prior)