Distributions, standardisation and normal models
Use numerical summaries and a suitable display to compare distributions. Sample standard deviation divides the squared-deviation total by n −1.
Data analysis, probability and statistics12 topic guides with practical teaching steps, visual explanations and links to practice.
Use your school or provider’s VCE sequence and assessment arrangements alongside these topic guides.
Browse this level’s worksheetsUse numerical summaries and a suitable display to compare distributions. Sample standard deviation divides the squared-deviation total by n −1.
Data analysis, probability and statisticsChoose the comparison for the variable types: two-way percentages for categories, side-by-side numerical summaries for groups, and scatterplots for paired numerical values.
Data analysis, probability and statisticsThe least-squares line minimises the sum of squared vertical residuals. Its slope is b=r(), with intercept a=ybar −b xbar.
A time series records values in time order. Separate long-term trend, recurring seasonal movement and irregular variation.
Data analysis, probability and statisticsA recurrence =R
+d models repeated percentage change and fixed additions or deductions. Choose a period and label
.
For end-of-period repayments A at interest i per period, balance =(1+i)
−A. Interest is calculated before each repayment.
A regular saving model with an end-period deposit A follows =(1+i)
+A. Separate the initial balance from later deposits.
Matrix products can count two-step connections or combine tabular data. Define whether rows or columns describe origin before interpreting entries.
Discrete mathematicsA state column can contain categories or age classes. Transition matrices preserve totals in closed probability models, whereas Leslie matrices may include births and deaths.
Discrete mathematicsAn Euler trail uses each edge once; a Hamiltonian path visits each vertex once. These answer different travel questions.
Discrete mathematicsA minimum spanning tree connects every vertex with least total edge weight and no cycle. Prim’s algorithm repeatedly connects a new vertex by the cheapest available edge.
Discrete mathematicsAssignment problems match each person or machine to one task while minimising cost or maximising benefit. Check all constraints, not just the cheapest individual entries.
Discrete mathematics