Skip to main content
Unit of study_

COMP4270: Randomised and Advanced Algorithms

2024 unit information

This unit of study will provide a rigorous introduction to a range of techniques and paradigms central to modern algorithm design, with a focus on randomised algorithms. The unit will emphasise the theoretical underpinnings of these algorithms and their mathematical guarantees, and provide intuition and understanding through a range of practical applications and examples such as probabilistic data structures, hashing, approximation algorithms, and streaming algorithms.

Unit details and rules

Managing faculty or University school:

Computer Science

Code COMP4270
Academic unit Computer Science
Credit points 6
(COMP2123 or COMP2823) and (COMP3027 or COMP3927)
Enrolment in a thesis unit. INFO4001 or INFO4911 or INFO4991 or INFO4992 or AMME4111 or BMET4111 or CHNG4811 or CIVL4022 or ELEC4712 or COMP4103 or SOFT4103 or DATA4103 or ISYS4103
Assumed knowledge:
Discrete Maths and Probability (MATH1064 or MATH1964) or equivalent

The learning outcomes for this unit will be available two weeks before the first day of teaching.

Unit availability

This section lists the session, attendance modes and locations the unit is available in. There is a unit outline for each of the unit availabilities, which gives you information about the unit including assessment details and a schedule of weekly activities.

The outline is published 2 weeks before the first day of teaching. You can look at previous outlines for a guide to the details of a unit.

Session MoA ?  Location Outline ? 
Semester 2 2024
Normal day Camperdown/Darlington, Sydney
Outline unavailable
There are no availabilities for previous years.

Modes of attendance (MoA)

This refers to the Mode of attendance (MoA) for the unit as it appears when you’re selecting your units in Sydney Student. Find more information about modes of attendance on our website.