Level 3 Decision maths
An introduction to the concept, and an investigation of the minimum distance someone would have to travel to deliver leaflets along all the streets near to a college, starting at and returning to the same place. Then students to find an Eulerian trail for a network with four odd nodes.
Slides (1.4 MB)
Student sheets Word (120 KB) Student sheets pdf (390 KB)
Teacher notes Word (74 KB) Teacher notes pdf (443 KB)
This activity introduces the terms used when working with networks, and gives students practice in using them.
This resource can be used as a classroom activity or an assignment. It involves students setting up their own network as the basis for a sightseeing tour. In identifying their route, students will need to make use of the Chinese Postman Algorithm and/or the Travelling Salesman Algorithm, depending on whether their route involves visiting the edges or the vertices of their network.
This activity shows students how to use Kruskal’s and Prim’s algorithms to solve minimum connector problems. A cable TV problem introduces the topic and the rules for the two algorithms. The students are then set a second problem involving a theme park.
An introduction to critical path analysis. The tasks are based on decorating and furnishing a bedroom, and take students through the process of constructing an activity network and calculating the minimum completion time for the project.