WACE Mathematics Applications past exams 2020–2025, by year and topic

The rest of the syllabus

Question-level mapping for these areas is still being verified. Every official paper covering them is in the year table above.

• Unit 3 — Bivariate data analysis — The statistical investigation process and describing association in percentaged two-way tables · Scatterplots, direction-form-strength, the correlation coefficient r and the coefficient of determination · Fitting and interpreting the least-squares line, residual plots, interpolation and extrapolation · Association versus causation: coincidence, confounding and common response
• Unit 3 — Growth and decay in sequences — Arithmetic sequences: recursion, nth-term rules and linear growth and decay · Geometric sequences: recursion, nth-term rules and exponential growth and decay · First-order linear recurrence relations, long-term behaviour and steady state
• Unit 3 — Graphs and networks — Graphs, digraphs and networks: terminology, adjacency matrices and multi-stage matrices · Planar graphs, faces and Euler's formula v + f − e = 2 · Walks, trails, paths, cycles, shortest paths, Eulerian and Hamiltonian graphs
• Unit 4 — Time series analysis — Time series plots: trend, seasonality, irregular fluctuations and outliers · Smoothing a time series with simple moving averages · Seasonal indices by the average percentage method, deseasonalising and predicting from the trend line
• Unit 4 — Loans, investments and annuities — Compound interest loans and investments: recurrence relations and the effective annual rate · Solving compound interest and depreciation problems with the finance solver · Reducing balance loans: recurrence models, repayments and time to repay · Annuities and perpetuities: recurrence models and finance-solver problems
• Unit 4 — Networks and decision mathematics — Trees, spanning trees, Prim's algorithm and minimum connector problems · Project networks, forward and backward scanning, critical paths and float · Maximum flow-minimum cut and assignment problems with the Hungarian algorithm