Units / FIT3155

FIT3155 · Advanced data structures and algorithms

Official Handbook

2026 Handbook6 credit pointsLevel 3Faculty of Information Technology

Last checked: 22 Aug 2026 UTC

Overview

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.

Areas of study: Advanced computer science Computational science

Offerings

CampusTeaching periodMode
ClaytonFirst semesterSome activities have a choice of on-campus or online teaching activities (FLEXIBLE)
MalaysiaFirst semesterTeaching activities are on-campus (ON-CAMPUS)
ClaytonSecond semesterSome activities have a choice of on-campus or online teaching activities (FLEXIBLE)
MalaysiaSecond semesterTeaching activities are on-campus (ON-CAMPUS)

Assessment

The Handbook lists an examination for this unit.

#AssessmentTypeWeightHurdle
1Assignment 1Artefact20%Threshold
2Assignment 2Artefact20%Threshold
3Scheduled final assessment (2 hours and 10 minutes)Examination60%Threshold

This unit has threshold mark hurdles. You must achieve at least 45% of the available marks in the final scheduled assessment, at least 45% in total for in-semester assessments, and an overall unit mark of 50% or more to be able to pass the unit. If you do not achieve the threshold mark, you will receive a fail grade (NH) and a maximum mark of 45 for the unit.

Assessment details may change. Please refer to the assessment information in Moodle closer to the start of the teaching period.

Requisites

prerequisite

  • FIT2004 — Algorithms and data structures

Learning outcomes

  1. Analyse efficient data structures and effective algorithmic paradigms;
  2. Design and implement efficient algorithms and data structures for use on large data sets;
  3. Apply advanced algorithms and data structures to tackle complex computational problems;
  4. Prove the correctness of programs and reason about their space and time complexities.

Workload

Minimum total expected workload to achieve the learning outcomes for this unit is 144 hours per semester typically comprising a mixture of scheduled online and face to face learning activities and independent study. Independent study may include associated reading and preparation for scheduled teaching activities. Offers 2 x 1 hrs blocks of online workshop weekly (starting week 2).

ActivityDuration
Laboratories33 hours
Seminars24 hours
Workshops22 hours

Ask about FIT3155

Answered from the Handbook fields above - no AI, no guessing. Every answer links back to the source.

Community discussions about FIT3155

Community

Student experience, not official rules. Nothing here changes what the Handbook says.

No discussions yet

Be the first to share what this unit was actually like.

Monash Hub is an independent student information platform and is not affiliated with or endorsed by Monash University. Always confirm enrolment, graduation, visa and academic policy decisions through the Monash website, Handbook, Moodle or WES.

Monash Hub 为独立学生信息平台,与 Monash University 无官方隶属或背书关系。重要决定请以官方最新信息为准。