Practice for this curriculum focus
Each linked topic collection contains learning, application and checkpoint resources with worked answers. The focus description is a summary; consult the official content description for its full wording and elaborations.
Connections to VCE learning
These are editorial prerequisite links. Each VCE resource explains the relationship.
General Mathematics · 29 learning targets
- Unit 1 · Key knowledge: Interpret simple matrices representing communication links.
- Unit 1 · Key skills: Construct a population transition matrix whose process has an equilibrium.
- Unit 2 · Key knowledge: Understand graph types, planar structure, adjacency matrices and traversal terminology.
- Unit 2 · Key knowledge: Understand weighted networks and the shortest-path problem.
- Unit 2 · Key knowledge: Explain trees, minimum spanning trees and greedy selection.
- Unit 2 · Key skills: Count a planar graph’s faces, vertices and edges and apply Euler’s relation.
- Unit 2 · Key skills: Model traversal problems using trails, paths, circuits, bridges and cycles.
- Unit 2 · Key skills: Find a shortest path by inspection in a weighted graph.
- Unit 2 · Key skills: Solve minimum-connector problems using trees and greedy methods.
- Unit 2 · Key skills: Construct graphs, directed graphs, networks and corresponding matrices for a situation.
- Units 3–4 · Key knowledge: Interpret communication and dominance matrices.
- Units 3–4 · Key knowledge: Connect transition diagrams, matrices and regularity.
- Units 3–4 · Key skills: Convert between a transition matrix, transition diagram and verbal description.
- Units 3–4 · Key knowledge: Understand graph types, adjacency matrices and planar Euler relationships.
- Units 3–4 · Key knowledge: Understand travelling and exploring problems and Eulerian or Hamiltonian traversal.
- Units 3–4 · Key knowledge: Understand minimum connectors, spanning trees and Prim’s procedure.
- Units 3–4 · Key knowledge: Understand capacities, cuts and the maximum-flow minimum-cut relationship.
- Units 3–4 · Key knowledge: Understand shortest paths and Dijkstra’s procedure.
- Units 3–4 · Key knowledge: Understand assignment and the Hungarian procedure.
- Units 3–4 · Key knowledge: Understand scheduling networks and critical-path analysis.
- Units 3–4 · Key skills: Construct a practical graph, directed graph or network and its matrix representation.
- Units 3–4 · Key skills: Solve travelling or exploring problems using the appropriate traversal concepts.
- Units 3–4 · Key skills: Solve minimum-connector problems by inspection or Prim’s algorithm.
- Units 3–4 · Key skills: Model and solve flow problems using inspection or maximum-flow/minimum-cut reasoning.
- Units 3–4 · Key skills: Solve shortest-path problems by inspection or Dijkstra’s algorithm.
- Units 3–4 · Key skills: Solve assignment problems by inspection or the Hungarian algorithm.
- Units 3–4 · Key skills: Solve scheduling problems using critical-path analysis.
- Units 3–4 · Key knowledge: Recognise the standard models and where they can be applied.
- Units 3–4 · Key skills: Choose matrix or network methods for an extended contextual investigation.
Specialist Mathematics · 7 learning targets
- Unit 1 · Key knowledge: Know graph terminology, representations, families and structural properties
- Unit 1 · Key knowledge: Recognise how graphs model problems and how suitable graphs are constructed
- Unit 1 · Key knowledge: Know elementary graph results and their proofs
- Unit 1 · Key skills: Construct graph models for given situations
- Unit 1 · Key skills: Use algorithms to build graph subsets satisfying conditions and solve associated problems
- Unit 1 · Key skills: Develop and explain graph results about planarity, trails and circuits
- Unit 1 · Key skills: Solve graph problems and prove related theorems
Curriculum source
Victorian Curriculum Mathematics Version 2.0
VCAA codes identify the official content descriptions. Aspire’s prerequisite and progression links are teaching connections, not VCAA equivalence statements or endorsement.