Year 12: Networks

2 dot points across 2 inquiry questions, in syllabus order. Each dot point has a focused answer, with exam-style questions and worked answers where available.

MS-N1 Networks and Paths: how are networks described, and how is the minimum spanning tree found?

N1.1 Networks: identify and use network terminology (vertex, edge, degree, weighted edge, path, connected, tree), construct network diagrams from real-life situations, and find a minimum spanning tree using Prim's or Kruskal's algorithm

Network vocabulary (vertices, edges, degree, weighted networks, paths, connected networks, trees, spanning trees), drawing networks from real situations, and finding minimum spanning trees with Prim's and Kruskal's algorithms, with the n minus 1 edges rule.

8 min read →

MS-N1 Networks and Paths: how is the shortest path between two vertices found?

N1.2 Shortest paths: find the shortest path between two vertices in a weighted network by inspection or by a systematic method, recognising that there may be more than one shortest path, and solve practical problems involving shortest paths

How to find the shortest path between two vertices in a weighted network, by inspection for small networks and systematically by labelling vertices with their shortest distance from the start, recognising multiple shortest paths, and applying it to travel, delivery and cabling problems.

7 min read →