Skip to main content
Unit of study_

COMP9123: Data Structures and Algorithms

2025 unit information

This unit will teach some powerful ideas that are central to solving algorithmic problems in ways that are more efficient than naive approaches. In particular, students will learn how data collections can support efficient access, for example, how a dictionary or map can allow key-based lookup that does not slow down linearly as the collection grows in size. The data structures covered in this unit include lists, stacks, queues, priority queues, search trees, hash tables, and graphs. Students will also learn efficient techniques for classic tasks such as sorting a collection. The concept of asymptotic notation will be introduced, and used to describe the costs of various data access operations and algorithms.

Unit details and rules

Managing faculty or University school:

Engineering

Study level Postgraduate
Academic unit Computer Science
Credit points 6
Prerequisites:
? 
None
Corequisites:
? 
None
Prohibitions:
? 
INFO1105 or INFO1905 or COMP2123 or COMP2823
Assumed knowledge:
? 
Discrete mathematics and probability (e.g. MATH1064 or equivalent) and programming experience (e.g. INFO1110 or COMP9001 or equivalent)

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

  • LO1. Examine the representation, manipulation algorithms, and complexity of commonly used data structures (e.g., lists, stacks, queues, priority queues, search trees, hash tables, graphs).
  • LO2. Understand basic algorithms related to data structures, such as sorting, tree traversals, and graph traversals.
  • LO3. Evaluate the asymptotic complexity of operations on data structures and algorithms using Big-O notation.
  • LO4. Propose basic algorithmic techniques (e.g., divide-and-conquer, greedy) to solve design tasks.
  • LO5. Design algorithmic solutions to problems, including coding, complexity analysis, and evaluation of performance in various contexts.
  • LO6. Present engineering/IT concepts and issues fluently to professional and non-professional audiences using a varied range of professional communication tools and formats.

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 1 2025
Normal evening Camperdown/Darlington, Sydney
Semester 2 2025
Normal evening Camperdown/Darlington, Sydney
Outline unavailable
Session MoA ?  Location Outline ? 
Semester 1 2020
Normal day Camperdown/Darlington, Sydney
Semester 1 2021
Normal evening Camperdown/Darlington, Sydney
Semester 1 2021
Normal evening Remote
Semester 2 2021
Normal evening Remote
Semester 1 2022
Normal evening Camperdown/Darlington, Sydney
Semester 1 2022
Normal evening Remote
Semester 2 2022
Normal evening Camperdown/Darlington, Sydney
Semester 2 2022
Normal evening Remote
Semester 1 2023
Normal evening Camperdown/Darlington, Sydney
Semester 1 2023
Normal evening Remote
Semester 2 2023
Normal evening Camperdown/Darlington, Sydney
Semester 1 2024
Normal day Camperdown/Darlington, Sydney
Semester 2 2024
Normal evening Camperdown/Darlington, Sydney

Find your current year census dates

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.