FSMQ Leve1 3 (pilot) Decision maths scheme of work
A suggested work scheme showing topics and methods to be covered is given below but the order and time allocations can be varied to suit different groups of students.
Note that the AQA assessment of this FSMQ is by examination only.
Throughout the course students should carry out work that involves them in:
 defining areas of investigation and selecting appropriate data to use
 drawing appropriate networks and carrying out analyses using an algorithmic approach
 drawing conclusions and critically summarising findings.
Topic area 
Content 
Nuffield resources 
Introduction to networks (4 hours) 
Represent situations using networks. Use terminology such as vertices (including the degree and odd/even), edges, edge weights, paths and cycles. Consider connectedness, directed, and undirected edges and graphs. Store graphs as matrices (such as adjacency/distance matrices). 
Networks 
Trees and spanning trees (10 hours) 
Understand that a tree is a connected graph with no cycles and that every connected graph contains at least one tree connecting all the vertices. Appreciate the relative advantages of Prim’s & Kruskal’s algorithms. Understand when a situation requires a minimum spanning tree. Comment on the appropriateness of solutions. 
Cable TV 
Shortest paths (8 hours) 
Appreciate that problems that involve finding paths of minimum time and cost can be considered to be shortest path problems. Apply Dijkstra’s algorithm using a labelling technique to identify the shortest path. Comment on the appropriateness of solutions. 
Shortest path 
Topic area 
Content 
Nuffield resources 
Route inspection problem (9 hours) 
Appreciate the connection with the classical problem of finding an Eulerian trail. Understand the significance of odd vertices and solve problems with 0, 2 or 4 odd vertices. Apply the Chinese Postman algorithm and comment on the appropriateness of a solution. 
Chinese postman problems 
Travelling salesperson problem (9 hours) 
Appreciate the connection with the classical problem of finding a Hamiltonian cycle. Determine upper bounds by using the nearest neighbour algorithm. Determine lower bounds (finding the length of a minimum spanning tree for a network formed by deleting a given node and then adding the two shortest distances to the given node). Appreciate when a solution is sufficiently good (realising that a solution is not necessarily the best and commenting on its appropriateness). 
Sightseeing tour 
Critical path analysis (12 hours) 
Construct activity networks. Find earliest and latest times (using forward and reverse passes). Identify critical activities and find a critical path (calculation of floats). Construct and interpret cascade diagrams. 
Refurbishing a room 
Revision (8 hours) 
Revise topics. Work through revision questions and practice papers. Discuss the Data Sheet  make up and work through questions based on it. 

Page last updated on 25 January 2012