Classify categorical and numerical data into their relevant subtypes.
Classify categorical and numerical data into their relevant subtypes.
Concepts and procedures
Outcome 1 retains the study design’s area and topic groups. Outcomes 2 and 3 include skills used across the course. Individual learning targets are concise paraphrases; the source reference identifies the original list. Internal Aspire references are not VCAA codes.
Classify categorical and numerical data into their relevant subtypes.
Recognise frequency tables and common categorical or numerical distribution displays.
Explain when and how to use a base-ten logarithmic scale.
Understand five-number summaries, boxplots and outlier identification.
Understand the sample mean and sample standard deviation.
Understand a normal model, the empirical rule and standardised scores.
Distinguish explanatory and response variables.
Choose association displays for categorical, numerical and mixed variable pairs.
Interpret Pearson correlation and distinguish correlation from causation.
Interpret the coefficient of determination as explained variation.
Understand least-squares fitting as a model of a linear association.
Explain why a transformation can make a non-linear association suitable for linear modelling.
Recognise time-series data and the methods used to analyse it.
Understand first-order recurrences as financial growth and decay models.
Understand flat-rate, unit-cost and reducing-balance depreciation and future-value formulas.
Explain interest rates, present and future value, loan or annuity amortisation and its tables.
Recognise recurrence models for interest, depreciation, loans, annuities, perpetuities and regular savings.
Understand matrix dimensions, named types, transpose, arithmetic and powers.
Explain the determinant criterion for a matrix inverse.
Understand the fixed-population and current-state assumptions of a transition model.
Interpret communication and dominance matrices.
Connect transition diagrams, matrices and regularity.
Understand graph types, adjacency matrices and planar Euler relationships.
Understand travelling and exploring problems and Eulerian or Hamiltonian traversal.
Understand minimum connectors, spanning trees and Prim’s procedure.
Understand capacities, cuts and the maximum-flow minimum-cut relationship.
Understand shortest paths and Dijkstra’s procedure.
Understand assignment and the Hungarian procedure.
Understand scheduling networks and critical-path analysis.
Construct frequency tables and bar charts and interpret categorical distributions.
Use categorical distributions to answer statistical questions.
Construct numerical plots and calculate summaries to describe a distribution.
Use numerical distributions to answer statistical questions.
Solve problems using standardised scores and the empirical normal rule.
Build two-way tables and interpret categorical association.
Construct parallel boxplots and interpret numerical–categorical association.
Construct scatterplots and describe numerical association.
Calculate Pearson correlation and interpret it in context.
Answer a statistical question using the association between two variables.
Calculate a least-squares equation to a specified precision while distinguishing causation from correlation.
Use and interpret a least-squares model of numerical association.
Interpret explained variation and use regression predictions cautiously.
Analyse residuals, transform unsuitable data and refit a linear model.
Describe time-series features, smoothing when needed, and interpret unusual changes.
Calculate, explain and apply seasonal indices.
Fit a linear time trend, forecast and discuss the limits of extending it.
Form and analyse a first-order linear recurrence in a financial setting.
Iterate a recurrence to find initial asset, investment or loan values over time.
Use a future-value rule for an investment, loan or depreciating asset.
Construct, analyse and interpret a loan or annuity amortisation table.
Use financial technology to solve investment, loan, annuity, perpetuity and regular-saving problems.
Iterate a matrix recurrence and recognise an eventual steady state in a regular process.
Convert between a transition matrix, transition diagram and verbal description.
Construct a transition matrix for a population with an equilibrium state.
Model population change including culling or restocking with a matrix recurrence.
Construct a practical graph, directed graph or network and its matrix representation.
Solve travelling or exploring problems using the appropriate traversal concepts.
Solve minimum-connector problems by inspection or Prim’s algorithm.
Model and solve flow problems using inspection or maximum-flow/minimum-cut reasoning.
Solve shortest-path problems by inspection or Dijkstra’s algorithm.
Solve assignment problems by inspection or the Hungarian algorithm.
Solve scheduling problems using critical-path analysis.