Back to Find Units Page

Unit of Study COMP3006 - Algorithms and Data Structures (2026)

Show me unit information for year

Unit Snapshot

  • Enrolment information

    N/A

Unit description

Once a student has mastered the basic programming patterns in a programming language, the next step is to learn how to use them to solve problems. One of the cornerstones of solving problems is knowing which patterns to apply. This is where algorithms and data structures become fundamental. Given a problem, a data structure is a particular implementation for storing and managing data for the problem, and an algorithm is a step-by-step list of instructions for solving the problem. A computer scientist or programmer familiar with elementary data structures and algorithms can use them to express solutions to problems. Familiarity with data structures and algorithms allows a programmer to tackle unthinkable problems using only a programming language’s basic control flow and loops.

Unit content

Module 1:  Common data structures

Module 2:  Recursion

Module 3:  Sorting algorithms

Module 4:  Searching algorithms

Module 5:  Algorithm efficiency

Module 6:  Algorithms and data structures in practice

Availabilities

Not currently available in 2026

Learning outcomes

Unit Learning Outcomes express learning achievement in terms of what a student should know, understand and be able to do on completion of a unit. These outcomes are aligned with the graduate attributes. The unit learning outcomes and graduate attributes are also the basis of evaluating prior learning.

On completion of this unit, students should be able to:

discuss common linear and non-linear data structures and sorting and searching algorithms using real-world examples

apply data structures and algorithms to practical problems

analyse algorithm complexity and its practical implication

demonstrate algorithm design techniques in solving real-world problems.