0%
COMP9123 · S1 2026
Data Structures & Algorithms
Study guides wired to your lecture PDFs, tutorials, and reference code — with quizzes, flashcards, a concept graph, and progress tracking. Built for the Usyd Mastery static hub pattern (shared modules under /shared/).
Coverage
11 weekly topics
Toolkit
Guides, foundations, quizzes, cards
Materials
PDFs + Python reference code
Mission control
Turn this hub into a mastery loop: read the guide, run checks, and watch progress move.
Awaiting first move
0
No streak yet — complete a quick check to begin.
0 / 10
Strong sections + checks + quiz build toward “cleared”.
Start Week 1
Read the study guide, then foundations and practice tools.
Launch →Weekly atlas
Pick a week — each card links to the study guide, foundations page, and mind map.
Week 1
Introduction & analysis
Algorithms, pseudocode, data structures, Big-O, search, and the array model.
ReadyPDFs + tutorial
Week 2
Lists & sequences
List ADT, array-backed lists, linked nodes, and the pointer rewiring patterns behind insert/delete.
Ready
Week 3
Stacks, queues & linked lists
Algorithm analysis, stacks, queues, method stacks, balanced parentheses, and ADT design questions.
ReadyCode
Week 4
Trees
Tree terminology, Tree ADT, traversals, binary trees, inorder, Euler tour, and recursive tree algorithms.
ReadyCode
Week 5
BSTs & AVL
BST order, path-based search/update, range queries, AVL balance, rotations, and augmented-tree reasoning.
ReadyCode
Week 6
Maps, heaps & priority queues
Map ADT, sorted-map queries, priority-queue trade-offs, heap invariants, array heaps, and build-heap reasoning.
ReadyCode
Week 7
Hashing
Direct addressing, hash design, load factor, chaining, linear probing, cuckoo hashing, and set/map reuse.
ReadyCode
Week 8
Graphs
Graph language, adjacency lists vs matrices, DFS spanning forests and cut edges, BFS layers, and bipartite reasoning.
Ready
Week 9
Graph algorithms
Weighted shortest paths, relaxation, Dijkstra, MST cut/cycle properties, Prim, Kruskal, and Union-Find.
Ready
Week 10
Greedy algorithms
Greedy pattern, counterexamples, fractional knapsack, interval partitioning, Huffman coding, and exchange arguments.
Ready
Week 11
Divide and conquer
Binary search, merge sort, recurrences, master theorem, and other classic divide-and-conquer algorithms.
Ready