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)
2024 · Paper 1 · Q10(iv) · p.39
If activity K takes 5 weeks instead of 3 weeks, what effect will this have on the critical path(s) and the time it takes to complete the project? Explain your answer. [Visual aid: None]
2024 · Paper 1 · Q10(iii) · p.39
What is a critical path? [Visual aid: None]
2024 · Paper 1 · Q10(ii) · p.39
Write down the critical path(s) for the network. [Visual aid: None]
2024 · Paper 1 · Q10(a) · p.38
The diagram below shows the scheduling network for manufacturing a car. The edges of the network represent the activities that have to be completed as part of the overall manufacture of the car and are labelled with the letters A to L. The duration, in weeks, of each activity is represented by the number in brackets. The unlabelled edges (shown with dashed lines) do not represent real activities but they help explain the order in which the activities must happen. The letters used to label the edges should not be taken as representing the order in which the activities happen. The nodes of the network represent events or points in time during the project. The source node is the time when the project begins and the sink node is the time when the project ends. [Network diagram for car manufacturing. Source node connects to A(3), B(5), C(2). A connects to D(1). B connects to E(7). C connects to F(4). D connects to G(3). E connects to H(4), I(5). F connects to G(3), H(4), I(5). G connects to L(1). H connects to L(1). I connects to J(6). J connects to M(2), N(4). K(3) is a separate activity. L connects to M(2). M connects to sink node. N connects to sink node. Dashed lines indicate precedence. For example, a dashed line from D to G indicates G can only start after D is finished.] (i) 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. [Diagram for completing early and late times for each event in the car manufacturing network. Boxes are provided at each node for early and late times.]
Marking scheme
[Diagram: A network graph with a source node and a sink node. Activities are represented by nodes with durations in parentheses: A(3), B(5), C(2), D(1), E(7), F(4), G(3), H(4), I(5), J(6), K(3), L(1), M(2), N(4). Arrows indicate dependencies: A->D, A->B, B->E, B->F, C->F, D->G, D->H, E->I, E->J, F->J, F->K, G->L, H->L, I->M, J->M, J->N, K->N, L->M. Numbers above arrows represent earliest start times, numbers below represent latest finish times. Critical path: A->D->G->L->M.] 20 [0/8/16/24/27]
2023 · Paper 1 · Q1(a) · p.3
A directed graph is represented by the adjacency matrix M, where ABCDEF A120100 B001001 C111120 M = D000001 E000020 F010000 (i) Use the nodes below to draw a graph represented by M. [Diagram: A grid with 6 points labelled A, B, C, D, E, F. A is top left, B is top right, C is middle left, D is middle right, E is bottom left, F is bottom centre.] (ii) Write down a cycle which starts at node B. (iii) How does a directed graph differ from an undirected graph?
Marking scheme
in a directed graph the edges have direction / in an undirected graph the edges do not have an arrow 5
2023 · Paper 1 · Q2(a) · p.6
A university has decided to improve the paths on its campus. In the network shown below the nodes labelled with the letters X and Y represent the two entrances to the campus and the nodes labelled with the letters A to N represent the key buildings on the campus. The edges represent the paths, with the weight of each edge representing the cost (in €) of carrying out the improvement work for that path. [Diagram: A network graph with nodes labelled X, Y, A, B, C, D, E, F, G, H, I, J, K, L, M, N. Edges connect various nodes with weights representing costs. For example, X is connected to A with weight 3400, X to B with weight 2500, B to C with weight 1250, etc. Y is connected to F with weight 900, Y to K with weight 2300, etc.] The university decides that the first part of the work will be to provide an improved route between entrance X and entrance Y. Use Dijkstra's algorithm to find the route between X and Y that is cheapest to improve. Calculate the cost of carrying out such improvements. Relevant supporting work must be shown.
Marking scheme
X: A(3400), B(2500), C(1250) C: B(2150), F(5150) B: F(4300), G(6350) A: D(6050), E(4200) E: D (5950) F: H(5900),I(6500) D: G(6600), J(8950) H:G(7250),I(7700) G: K(8850) I:K(9850), L(11250) K:J(10750), L(9800) J: M(9900) L: X(12100), N(11750) M:Y(11450) Path = X → A →E→ D → J→M→Y Cost = €11 450 20 [0/8/14/17]
2023 · Paper 1 · Q7(a) · p.26
There are 12 waterfalls in a certain national park. Paths allow visitors to walk from one waterfall to another. In the network shown below, the edges represent the paths and the nodes represent the waterfalls, labelled with the letters A to L. The weight of each edge represents the time (in minutes) taken to walk between a pair of waterfalls. [Diagram: A network graph with nodes labelled A to L. Edges connect various nodes with weights representing time in minutes. For example, A is connected to B with weight 16, A to D with weight 17, B to C with weight 19, etc.] The park authorities wish to plan a route along the paths which allows visitors to see every waterfall while moving through the park without wasting time. The paths that are not on this route will be closed. (i) Using an appropriate algorithm, find the minimum spanning tree for the network. Name the algorithm you used. Relevant supporting work must be shown.
Marking scheme
dN/dt = k(2000 – N) so ∫ dN / (2000-N) = ∫ kdt 5
2023 · Paper 1 · Q9(v) · p.37
The hospital manager visits the project on day 18 to check the progress of the work, which is on schedule. Write down the activities which may be happening on day 18.
Marking scheme
E, F, D, G 5
2023 · Paper 1 · Q9(iv) · p.37
A cascade chart (Gantt chart) is a type of bar chart which may be used to represent a project's schedule. The duration of each activity is represented by the width of the horizontal bar for that activity, with time on the horizontal axis. The float time for an activity is represented by a rectangle drawn using dotted lines to the right of the bar for that activity. The top row of a cascade chart is used for a critical path. Draw a cascade chart or similar bar chart to represent the schedule for this project. [Graph: Axes labelled 'day' from 0 to 34. Grid lines are shown at intervals of 2 for the day axis.]
Marking scheme
[Gantt Chart: Activities A, B, C, D, E, F, G, H, I, J, K, L are plotted against time in days (2 to 34). A runs from day 2 to 16. B runs from day 2 to 14. C runs from day 4 to 14. D runs from day 16 to 28 (+4). E runs from day 16 to 20. F runs from day 14 to 18. G runs from day 14 to 16 (+2). H runs from day 20 to 30. I runs from day 20 to 30 (+2). J runs from day 20 to 32. K runs from day 18 to 30. L runs from day 30 to 32.] 10 [0/4/7]
2023 · Paper 1 · Q9(iii) · p.36
Write down the critical path(s) for the network.
Marking scheme
A, E, J, L and A, E, K 5
2023 · Paper 1 · Q9(ii) · p.35
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. [Diagram: A project network similar to the one in part (a)(i), with boxes at each node for early and late times. The diagram shows activities and their durations.] Use the space below and on the next page to show relevant supporting work, if necessary.
Marking scheme
[Diagram: A project network diagram. Source node (0) connects to A(14), B(12), C(14). A connects to D(12) and E(5). B connects to G(3) and H(12). C connects to F(4) and I(11). D connects to J(11) and L(2). E connects to J(11). G connects to J(11). H connects to K(13). F connects to K(13). J connects to I(11) and L(2). I connects to sink node (32). L connects to sink node (32). Numbers in parentheses are durations. Numbers on nodes are earliest finish times. Dashed arrows indicate alternative paths.] 20 [0/8/14/17]
2023 · Paper 1 · Q9(i) · p.34
The manager of a regional hospital decides to arrange for the refurbishment of one of the hospital wards. The diagram below shows the scheduling network for the project. The edges of the network represent the activities that have to be completed as part of the project and are labelled with the letters A to L. The duration, in days, of each activity is represented by the number in brackets. The unlabelled edges (shown with dashed lines) do not represent real activities but they help explain the order in which the activities must happen. The letters used to label the edges should not be taken as representing the order in which the activities happen. The nodes of the network represent events or points in time during the project. The source node is the time when the project begins and the sink node is the time when the project ends. [Diagram: A project network with a source node and a sink node. Activities are represented by edges labelled A to L with durations in brackets. For example, A(14), B(12), C(14), D(12), E(5), F(4), G(3), H(12), I(11), J(11), K(13), L(2). Dashed lines indicate dependencies between events.] Complete the table on the next page by listing, for each activity, the other activities on which it depends directly. That is, for each activity X in {A, B, C, ..., L}, write the smallest possible list of other activities which need to be completed before activity X can begin. Use the space below to show relevant supporting work, if necessary.
Marking scheme
Activity Depends directly on Activity Depends directly on A - G B, C B - H E,F,G C - I B, C, E D A J B, C, E E A K E,F,G F C L D, J -1 for each incorrect part A to L 10