Overview
This course is a continuation of our introductory algorithms courses COMP3121/3821/9101/9801. We will cover some randomized algorithms and data structures, such as randomized hashing, skiplists, order statistics and Karger's randomized Min Cut algorithm. We will then look at the Markov chains and the Google PageRank algorithm, Hidden Markov Models and … For more content click the Read More button below.
Conditions for Enrolment
Prerequisite: COMP3121 or COMP3821.
Delivery
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)