Matrices and networks — Topic Review | Year 11

QUICK RECAP

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.

Complete each paper and show your working.

Matrices and networks — Practice test 1
10 questions · 40 marks · 65 minutes · Scientific calculator
An original mixed chapter paper. Show calculations, state units and justify network decisions using the supplied information.
Open test Marking guide
Matrices and networks — Practice test 2
10 questions · 40 marks · 65 minutes · Scientific calculator
An original mixed chapter paper. Show calculations, state units and justify network decisions using the supplied information.
Open test Marking guide
Matrices and networks — Practice test 3
10 questions · 40 marks · 65 minutes · Scientific calculator
An original mixed chapter paper. Show calculations, state units and justify network decisions using the supplied information.
Open test Marking guide
Matrices and networks — Practice test 4
10 questions · 40 marks · 65 minutes · Scientific calculator
An original mixed chapter paper. Show calculations, state units and justify network decisions using the supplied information.
Open test Marking guide
Matrices and networks — Applications and reasoning test
10 questions · 60 marks · 75 minutes · Scientific calculator
An original mixed chapter paper. Show calculations, state units and justify network decisions using the supplied information.
Open test Marking guide