School:
Rossmoyne SHS
2026 Course & Assessment Schedule
Based on the ATMAA Course Outline v2 — subject to change
Term 1 (from 4 Feb)
Week Dates Topic Assessment
W1–2 4–14 Feb 3.2 Arithmetic & geometric sequences
W3–4 17 Feb – 28 Feb 3.2 Geometric sequences, first-order linear recurrence relations, steady state
W5 3–7 Mar 3.1 Two-way tables, scatterplots, correlation coefficient
W6 10–14 Mar 3.1 Least-squares line, r², association & causationTest 1 — Wed 11 Mar (10%)Sequences & Association
W7 17–21 Mar 3.1 Least-squares regression, residual plots, interpolation vs extrapolationInvestigation 1 out
W8 24–28 Mar 3.1 Residual analysis, investigation processInvestigation 1 — Wed 25 Mar (10%)
W9 31 Mar – 3 Apr 3.1 Statistical investigation process
Term 2 (from 21 Apr)
Week Dates Topic Assessment
W1–2 21 Apr – 2 May 3.3 Graph theory: vertices, edges, adjacency matrices, planar graphs, Euler's formula
W3 4–8 May 3.3 Paths, cycles, Eulerian/Hamiltonian trails, shortest pathTest 2 — in-class (10%)Bivariate Data & Graph Theory
W4 11–15 May Revision for Semester 1 Exam
W5–6 18–29 May Semester 1 Exam — Unit 3 (15%)
W7–8 1–12 Jun 4.1 Time series plots, moving averages, seasonal indices, deseasonalised data, trend lines
W9 15–19 Jun 4.1 Time series investigation processInvestigation 2 out
W10 22–26 Jun 4.2 Compound interest, effective annual rate, reducing balance loansInvestigation 2 — in-class (10%)
W11 29 Jun – 3 Jul 4.2 Reducing balance loans continued
Term 3 (from 20 Jul)
Week Dates Topic Assessment
W1 20–24 Jul 4.2 Annuities and perpetuities
W2 27–31 Jul 4.2 Annuities and perpetuities continuedTest 3 — Wed 29 Jul (10%)Networks, Time Series & Finance
W3 3–7 Aug Chapter review
W4–5 10–22 Aug 4.3 Spanning trees, Prim's algorithm, Hungarian algorithm
W6 24–28 Aug 4.3 Network flow, max-flow min-cut
W7 31 Aug – 4 Sep 4.3 Project networks, critical path analysisTest 4 — Wed 2 Sep (10%)Annuities, Spanning Trees, Hungarian, Flow
W8 7–11 Sep Revision for Semester 2 Exam
W9–10 14–25 Sep Semester 2 Exam — Units 3 & 4 (25%)
Term 4 (from 12 Oct)
Week Dates Topic Assessment
W1–2 12–22 Oct Exam feedback & WACE exam preparation
Nov TBA WACE Exam — external (50%)
Assessment Weighting Summary
Type Component Weight
Response (40%) Test 1 — Sequences & Association 10%
Test 2 — Bivariate Data & Graph Theory 10%
Test 3 — Networks, Time Series & Finance 10%
Test 4 — Annuities, Spanning Trees, Hungarian, Flow 10%
Investigation (20%) Investigation 1 10%
Investigation 2 10%
Examination (40%) Semester 1 Exam — Unit 3 15%
Semester 2 Exam — Units 3 & 4 25%
Priority 1 High-Impact Weak Areas
These issues are flagged by examiners every year from 2020–2023 . Fixing them is the fastest path to more marks.
Area Why It Matters Action
Basic arithmetic (no calculator) Flagged as poor every single year Daily drills: fractions, decimals, percentages by hand
Interpretation & justification Students calculate correctly but can't explain the answer "in context" Practise writing one-sentence interpretations for every answer
Finance (annuities, perpetuities, loans) Consistently the hardest questions (mean ~41% in 2023) Work through every past finance question with marking key
Showing working Marks lost every year for skipping steps, even on 2-mark questions Write every step — markers award follow-through marks
Unit 3, Topic 1: Bivariate Data Analysis Unit 3
Two-way frequency tables: completing tables, row/column percentages, identifying explanatory vs. response variables, stating associations
Scatterplots and least-squares regression: correlation coefficient (r), coefficient of determination (r²), equation of least-squares line (y = a + bx)
Interpreting gradient and intercept in context
Drawing the regression line on a scatterplot
Residual analysis: calculating residuals (observed minus predicted), plotting residual plots, interpreting patterns
Use the given variables (not generic x, y). Always note that extrapolation (predicting outside the data range) is unreliable.
Unit 3, Topic 2: Growth and Decay in Sequences Unit 3
Arithmetic sequences: recursive rules (Tn+1 = Tn + d), nth term rules (Tn = a + (n−1)d)
Geometric sequences: recursive and nth term rules, common ratio, percentage growth/decay
First-order linear recurrence relations (Tn+1 = bTn + c)
Steady-state / long-term values: solving T = bT + c for equilibrium
Real-world modelling: depreciation, population growth, wages, subscriptions
Unit 3, Topic 3: Graphs and Networks Unit 3
Graph theory fundamentals: vertices, edges, faces, degree of vertices, adjacency matrices, connected graphs, planar graphs
Euler's formula (v + f − e = 2): verification and interpretation
Eulerian and semi-Eulerian trails: determining existence based on odd/even vertex degrees
Hamiltonian paths and circuits: identifying and demonstrating
Bipartite graphs
Always include arrows on directed networks — marks are lost for this every year.
Unit 4, Topic 1: Time Series Analysis Unit 4
Seasonal / daily indices: calculating, interpreting in context, estimating totals from partial data
Deseasonalised data: calculating and interpreting
Centred moving averages
Least-squares trend lines on deseasonalised data
Forecasting / predicting future values using trend lines and seasonal indices
Time series is a staple of the Calculator-Assumed section, typically worth 13–16 marks as a single multi-part question.
Unit 4, Topic 2: Loans, Investments and Annuities Unit 4
Simple and compound interest: formulas A = P(1+r)t and A = P(1 + r/n)nt
Reducing balance loans: recursive modelling (Tn+1 = (1+r)Tn − payment), loan duration, final repayment, total interest
Savings accounts / investments: recursive modelling of deposits with compound interest
Annuities: modelling with recursive rules, determining payment amounts, balance tracking
Perpetuities: calculating perpetuity payments from a balance
Effective annual interest rate: comparing compounding frequencies using ieff = (1 + i/n)n − 1
Scenario comparison: lump sum payments, changed repayments, interest savings
Set up the recursive rule clearly and show every step. Finance questions are the biggest discriminator between grades.
Unit 4, Topic 3: Networks and Decision Mathematics Unit 4
Shortest path problems: Dijkstra's algorithm or systematic working
Minimum spanning trees: Prim's algorithm (applied to tables/matrices)
Network flow: sources, sinks, maximum flow, minimum cut (max-flow min-cut theorem), augmenting paths
Project networks (critical path analysis): drawing network diagrams from precedence tables, critical path, minimum completion time, float times, dummy activities
Hungarian algorithm for optimal allocation (both minimisation and maximisation)
Networks dominate the Calculator-Free section (2–3 questions). Always include arrows on directed edges and dummy links.
Priority 3 Exam Technique
Tips from Examiner Reports
Read questions carefully — highlight or underline key words
Use brackets on your calculator, especially for negative numbers
Always show working for questions worth 2+ marks
Answer in context — refer to the scenario, not generic maths
Use a highlighter for routes on network diagrams
Round appropriately — whole numbers for discrete objects, correct units always
Use correct terminology from the syllabus glossary
Formula Sheet Reference
The formula sheet (provided in the exam) covers:
Unit 3 Unit 4
Residual value formula Deseasonalised value formula
Least-squares line form Simple interest formula
Arithmetic sequence formula Compound interest formula
Geometric sequence formula Effective annual interest rate
First-order linear recurrence relation Euler's formula
Calculator-Free Practice Questions
50 minutes | 35% of total exam | No calculator, no notes | Formula sheet provided
By Topic
By Year
Topic 1: Bivariate Data Analysis Unit 3 — 12 questions
Topic 2: Growth and Decay in Sequences Unit 3 — 9 questions
Topic 3: Graphs and Networks Unit 3 — 13 questions
Topic 4: Time Series Analysis Unit 4 — 1 question
Topic 5: Loans, Investments and Annuities Unit 4 — 1 question
Topic 6: Networks and Decision Mathematics Unit 4 — 21 questions
Hungarian Algorithm
Project Networks / Critical Path Analysis
Network Flow / Max-Flow Min-Cut
Shortest Path & Minimum Spanning Tree
2025 — 5 questions (51 marks)
2024 — 5 questions (54 marks)
2023 — 6 questions (52 marks)
2022 — 7 questions (54 marks)
2021 — 7 questions (52 marks)
2020 — 6 questions (47 marks)
2019 — 6 questions (55 marks)
2018 — 7 questions (55 marks)
2017 — 7 questions (53 marks)
Calculator-Assumed Practice Questions
100 minutes | 65% of total exam | Up to 3 calculators, 2 A4 sheets of notes, drawing instruments
By Topic
By Year
Topic 1: Bivariate Data Analysis Unit 3 — 15 questions
Topic 2: Growth and Decay in Sequences Unit 3 — 14 questions
Topic 3: Graphs and Networks Unit 3 — 4 questions
Topic 4: Time Series Analysis Unit 4 — 9 questions
Topic 5: Loans, Investments and Annuities Unit 4 — 24 questions
Topic 6: Networks and Decision Mathematics Unit 4 — 18 questions
Hungarian Algorithm
Project Networks / Critical Path Analysis
Network Flow / Max-Flow Min-Cut
Shortest Path & Minimum Spanning Tree
2025 — 8 questions (100 marks)
2024 — 8 questions (99 marks)
2023 — 8 questions (97 marks)
2022 — 10 questions (97 marks)
2021 — 9 questions (94 marks)
2020 — 10 questions (105 marks)
2019 — 11 questions (100 marks)
2018 — 10 questions (96 marks)
2017 — 9 questions (94 marks)