Mathematics A, Further H235: Network Algorithms Topical Past Paper Questions
OCR AS Mathematics A, Further (H235) past-paper questions on Network Algorithms, free. This topic is frequently examined across 4 exam sessions. Sign in for the full topic-segregated question bank and AI worksheets.
Sample questions
A garden centre sells mixed packs of flower bulbs. Each pack contains bulbs which produce flowers of two different colours. The cost, in £, of a pack of each colour combination is shown in the table below. (a) Represent the information in the table as a network in which the verti…
A network is shown below. (a) Use an appropriate algorithm to find the least weight (shortest) path from A to D. (b) Use Kruskal's algorithm to find a minimum spanning tree for the network.
The diagram shows a simplified map of the main streets in a small town. Some of the junctions have traffic lights, these junctions are labelled A to F. There are no traffic lights at junctions X and Y. The numbers show distances, in km, between junctions. Alex needs to check that…
Sign in required
Full Network Algorithms question set, mark schemes and AI worksheets
Log in for the full topic-segregated question set, mark schemes, and AI worksheets built from every Mathematics A, Further past paper. New accounts start with 25 free credits.
Explore all Mathematics A, Further topics
All Mathematics A, Further topics