Study notes
No notes have been generated for this topic yet. Open the topic page online and click Generate notes first.
Past exam questions (12)
2023 · Paper 1 · Q10(vi) · p.38
For a particular account, activity F takes twice as long as usual. Does this cause a delay in the processing of the account? Justify your answer.
Marking scheme
no; 48 minutes is less than the float for F 5
2023 · Paper 1 · Q10(v) · p.38
Exactly one hour after the processing of an account has begun, a supervisor checks the work. State which activity (or activities) must be happening at this time. Justify your answer.
Marking scheme
C and D justification 5
2023 · Paper 1 · Q10(iv) · p.38
Calculate the float, in minutes, for activity I.
Marking scheme
233 - 88 - 66 = 79 minutes 5
2023 · Paper 1 · Q10(iii) · p.38
If the workers begin processing an account at 09:30 a.m., calculate the earliest time when the work could be completed.
Marking scheme
15:29 i.e. 3:29 p.m. 5
2023 · Paper 1 · Q10(ii) · p.37
Write down the critical path(s) for the network.
Marking scheme
B→D→J→K 5
2023 · Paper 1 · Q10(i) · p.36
The diagram below shows the scheduling network that an accounting company uses for processing an account. The edges of the network represent the activities that the workers need to carry out when processing an account and are labelled with the letters A to L. The letters used to label the edges should not be taken as representing the order in which the activities happen. The time, in minutes, to complete each of the activities is shown in brackets. The nodes of the network represent events or points in time during the processing of an account. The source node is the time when the processing begins and the sink node is the time when the processing ends. [Diagram: A network graph with nodes labelled A to L, plus a source and sink node. Edges represent activities with durations in brackets: Source to A (52), Source to B (40), A to C (62), B to D (100), B to F (48), C to E (25), C to H (117), D to F (48), E to G (85), F to G (85), F to I (66), G to I (66), G to J (96), H to I (117), I to L (126), J to K (123), K to L (126). Each node has two boxes, one above the other, for early and late times.] Calculate the early time and the late time for each event. Complete the diagram below by writing the early time (upper box) and late time (lower box) at the node representing each event.
Marking scheme
[Network diagram: Source node A (0). Edges from A to B (40) and E (52). Edges from B to D (40). Edges from E to C (54) and F (48). Edges from C to G (62) and H (116). Edges from F to D (40) and G (48). Edges from D to J (100). Edges from G to I (85) and J (140). Edges from H to I (117) and L (126). Edges from I to J (66) and K (123). Edges from J to K (236). Edges from K to L (359). Edges from L to Sink (359). Node values shown: A(0), B(40), D(40), E(52), C(54), F(48), J(140), G(85), H(116), I(66), K(123), L(126). Sink node value is 359.] 20 [0/8/14/17]
2023 · Paper 1 · Q4(b) · p.16
Mark is planning to visit South America. He plans to begin his visit in city A, and then travel across South America to meet some friends in city I. Mark wishes to keep his travel costs to a minimum. He wishes to calculate the cost of travelling to city I by bus, travelling via some of the other cities, B to H. The cost, in €, of travelling by bus between various cities is shown in the network below. Mark does not intend on visiting all of the cities in his network. [Diagram: A network graph representing cities A to I. Edges and their costs are: A-B (75), A-C (87), A-D (84), B-E (99), B-F (60), C-D (49), C-G (105), D-F (135), E-F (50), E-H (122), F-G (111), G-H (188), G-I (48), H-I (48). A map of South America is shown in the background.] Use Dijkstra's algorithm to find the cheapest bus route from city A to city I. Calculate the cost of the cheapest route. Relevant supporting work must be shown.
Marking scheme
A: B(75), C(105), D(84) B: D(135), E(174) D: C(133), F(219) C: G(192) E: F(224), H(296) G: I(380) F: I(330) H: I(344) Path = A→D→F→I Cost = €330 20 [0/8/14/17]
2023 · Paper 1 · Q4(a)(iii) · p.15
The pipes used are priced at €525 per metre. In addition, there is an installation cost of €6500 when any two buildings are connected by pipework. Use your minimum spanning tree to calculate the total cost of this project.
Marking scheme
(6500) + (145 + 190 + 210 + 425)(525) = €535 250 5
2023 · Paper 1 · Q4(a)(ii) · p.15
To help reduce costs, the engineer must minimise the length of pipework needed for this heating system. Using an appropriate algorithm, find the minimum spanning tree for this network. Name the algorithm you used. Relevant supporting work must be shown.
Marking scheme
Kruskal's algorithm: |CE| = 145, |AE| = 190, |BE| = 210, |AB| = 300, |CD| = 425. Prim's algorithm: Choose node A, say. |AE| = 190, |BE| = 210, |CE| = 145, |CD| = 425. 15 [0/6/9/12]
2023 · Paper 1 · Q4(a)(i) · p.14
In an effort to become more energy efficient, a university campus invests in upgrading its current heating system. Each of the five buildings (Arts, Business, Cafeteria, Design, Engineering) that are on the campus will require connection to this new heating system. An engineer measures the underground distance, in m, between each of the buildings on the campus grounds. She presents her results in the table below. [Table: Distances between buildings. Rows and columns are labelled Arts, Business, Cafeteria, Design, Engineering. Values are: Arts-Business: 300, Arts-Cafeteria: 650, Arts-Design: 525, Arts-Engineering: 190. Business-Cafeteria: 475, Business-Design: 790, Business-Engineering: 210. Cafeteria-Design: 425, Cafeteria-Engineering: 145. Design-Engineering: 505. Diagonal values are '-'.] Draw a network to represent this information. On your network the weights of the edges should represent the distances between each of the buildings, which should be represented by labelled nodes.
Marking scheme
[Diagram: A network graph with nodes A, B, C, D, E. Edges and their weights are: AB=300, AC=475, AD=650, AE=190, BC=790, BD=525, BE=210, CD=145, CE=425, DE=190. The diagram shows a complete graph K5.] 10
2023 · Paper 1 · Q5(b) · p.21
The algebraic formulae below are written in terms of momentum p, mass m, displacement s and time t. Which of the formulae, X or Y, has the same units as the units for velocity, m s⁻¹? Use dimensional analysis (comparison of units) to justify your answer. X: sqrt(2pm / st) Y: sqrt(2ps / mt) [Visual aid: formulae X and Y]
Marking scheme
Y justification 5
2023 · Paper 1 · Q9(a)(iii) · p.33
If the student modelled the motion of this car being driven on the same road in December, explain one refinement that the student might make to the mathematical model.
Marking scheme
e.g. colder road might change μ 5