Overview

Students will learn a variety of algorithm design techniques (greedy, dynamic programming, divide and conquer, etc). This will include famous algorithms using these ideas in graph problems, string matching, etc, but more importantly how to apply these ideas to develop correct and efficient algorithms to solve new problems. Students will … For more content click the Read More button below. There is also an extended Algorithms course COMP3821/9801 which runs only in T1 each year. We recommend that top students take the extended course instead of this one. Extended Algorithms moves at a faster pace and covers more topics and some topics in more depth. It assumes higher autonomy from students and offers a few different perspectives on problem solving.

Conditions for Enrolment

Prerequisite: COMP9024.

Delivery

In-person - Standard (usually weekly or fortnightly)
Multimodal - 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)