Connect the ideas.
- Matrix entries require matching row/column labels and units.
- Add equal-order matrices entry by entry; multiply compatible matrices row by column.
- Arrows restrict direction and network weights require units.
- An adjacency power counts walks, not automatically simple paths.
- Shortest path, minimum spanning tree and maximum flow solve different optimisation problems.
- A feasible flow matching a cut capacity proves a maximum.
- Check constraints and assumptions before recommending a solution.
Put it together.
Choose a paper and show your working.
Matrices and networks — Practice test 1
An original mixed chapter paper. Show calculations, state units and justify network decisions using the supplied information.
10 questions · 40 marks · 65 minutes · Scientific calculatorMatrices and networks — Practice test 2
An original mixed chapter paper. Show calculations, state units and justify network decisions using the supplied information.
10 questions · 40 marks · 65 minutes · Scientific calculatorMatrices and networks — Practice test 3
An original mixed chapter paper. Show calculations, state units and justify network decisions using the supplied information.
10 questions · 40 marks · 65 minutes · Scientific calculatorMatrices and networks — Practice test 4
An original mixed chapter paper. Show calculations, state units and justify network decisions using the supplied information.
10 questions · 40 marks · 65 minutes · Scientific calculatorMatrices and networks — Applications and reasoning test
An original mixed chapter paper. Show calculations, state units and justify network decisions using the supplied information.
10 questions · 60 marks · 75 minutes · Scientific calculator
Curriculum reference & lesson scope
SACE Board of South Australia
Stage 1 General Mathematics: matrices and networks. Original learning resources follow the approved Ascent Library chapter map.
Official curriculum source ↗