Faculty of Information Technology

print version

This unit entry is for students who completed this unit in 2016 only. For students planning to study the unit, please refer to the unit indexes in the the current edition of the Handbook. If you have any queries contact the managing faculty for your course or area of study.

Monash University

6 points, SCA Band 2, 0.125 EFTSL

Undergraduate - Unit

Refer to the specific census and withdrawal dates for the semester(s) in which this unit is offered.


Information Technology


Not offered in 2016


This advanced unit builds on the concepts learnt in introductory algorithms and data structures study. It covers the latest algorithmic paradigms and problem-solving techniques required to address real-world programming challenges. It explores, in depth, the design and analysis of space-efficient/compact data structures and effective problem solving strategies to be used with them. Topics include advanced sorting and searching algorithms, succinct/compact trees, string and graph data structures, advanced hashing and table lookup methods


At the completion of this unit, students should be able to:

  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.


Examination (3 hours): 70%; In-semester assessment: 30%

Workload requirements

Minimum total expected workload equals 12 hours per week comprising:

(a.) Contact hours for on-campus students:

  • Two hours lectures weekly
  • Two hours laboratories weekly
  • One hour tutorial fortnightly

(b.) Additional requirements (all students):

  • A minimum of 8 hours independent study per week for completing lab and project work, private study and revision.

See also Unit timetable information