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
Academic unit | Computer Science |
---|---|
Credit points | 6 |
Prerequisites
?
|
(DATA3888 or COMP3888 or COMP3988 or CSEC3888 or ISYS3888 or SOFT3888 or ENGG3112 or SCPU3001) and (COMP2123 or COMP2823) and (COMP3027 or COMP3927) |
Corequisites
?
|
None |
Prohibitions
?
|
COMP5270 |
Assumed knowledge
?
|
A major in a computer science area. Discrete mathematics and probability (e.g. MATH1064 or equivalent) |
Available to study abroad and exchange students | Yes |
Teaching staff
Coordinator | Clement Canonne, clement.canonne@sydney.edu.au |
---|