Professional Course
Data Structures And Algorithms
Think like a computer scientist — the problem-solving foundation behind every great developer, taught the Australian way.
DAT

$99.00
- Full lifetime access
- Certificate of completion
- Access on all devices
- 30+ of content
- Downloadable resources
About This Course
Course Overview
Every piece of software you have ever used — from your banking app to the checkout at Coles — stands or falls on two things: how it organises its data, and how efficiently it works with that data. Data structures and algorithms are the difference between code that merely runs and code that scales, between a developer who copies solutions and one who designs them. They are also, without exception, the subject matter of every serious technical interview at Australian and global tech employers alike.
This course is a complete, ground-up pathway: you begin with how a computer actually stores information and finish able to select, implement and reason about the right structure and the right algorithm for a real problem — and to defend your choice in Big-O terms. Every example is practical and Australianised: postcodes and suburb lookups for hash tables, Melbourne's train network for graphs, delivery routes along the Surf Coast for shortest-path algorithms, and AUD-denominated scenarios throughout.
Fully self-paced and delivered through our Moodle LMS as interactive lessons, each chapter combines short, focused reading with animated algorithm visualisations, hands-on coding activities, knowledge checks, drag-and-drop exercises and branching real-world scenarios — so you're doing, not just watching, from the very first session.
Learning Outcomes
What You Will Learn
Analyse any piece of code and state its time and space complexity in Big-O notation
Implement the core data structures from scratch in Python — arrays, linked lists, stacks, queues, hash tables, trees, heaps and graphs
Choose the right data structure for a problem using a professional decision framework, and justify the trade-offs
Implement and compare the classic sorting algorithms — bubble, insertion, merge, quick and heap sort
Search efficiently with binary search and hash-based lookups, and recognise when a problem is secretly a search problem
Traverse and analyse trees and graphs with DFS and BFS, and apply Dijkstra's algorithm to real route-finding
Solve problems with recursion, divide-and-conquer, greedy strategies and dynamic programming
Use Python's built-in structures (list, dict, set, deque, heapq) idiomatically, knowing what each costs under the hood
Whiteboard a solution under interview conditions — clarify, brute-force, optimise, code, test
Read and reason about the algorithmic behaviour of production code, and make it measurably faster
Before You Start
Requirements
- A computer (Windows, macOS or Linux) with a modern browser — all coding runs in the browser, nothing to install
- Basic programming experience in any language — if you can write a loop, a function and an if-statement, you're ready
- A reliable internet connection
- No prior Python needed — Week 1 includes a gentle Python refresher. No maths beyond high-school level assumed
Ideal For
Who Is This Course For?
Self-taught developersCareer changersStudents & graduatesWorking professionals
At a Glance
Course Details
Skill Level
Beginner → Job-ready
Language
English
Certificate
Yes, on completion
Access
Life Time
Format
Online, self-paced
Duration
30+


