MonMap
A course mapper by Monash Association of Coding (MAC)
Advanced data structures and algorithms
FIT3155
Synopsis
This unit builds on the concepts learnt in introductory algorithms and data structures study. It covers advanced algorithmic paradigms and problem-solving techniques required to address real-world programming challenges. It explores, in depth, the design and analysis of space-efficient data structures and time-efficient problem solving strategies to be used with them. Topics include amortized analysis, advanced sorting and searching algorithms, new tree/string/graph data structures and algorithms, and number-theoretic algorithms amongst others.
Sourced from the Monash Handbook 2026.
Quick facts
- Credit points
- 6
- Level
- 3
- Audience
- Undergraduate
- Type
- Coursework
- School
- Faculty of Information Technology
- Handbook year
- 2026
Prerequisites (1)
What it unlocks
Nothing in the visible graph depends on this unit.
Offerings (4)
- First semesterMalaysia · ON-CAMPUS / Clayton · FLEXIBLE
- Second semesterClayton · FLEXIBLE / Malaysia · ON-CAMPUS
Listed in 5 areas of study
- Algorithms and softwareCore units
- Computational scienceComputer science electives
- Computational scienceComputer science electives
- Computer scienceAdditional Computer science unit
- Software engineeringSoftware engineering technical electives