Lesson 3D.4.3

3D.4.3 Critical path algorithm Quiz: Pearson Edexcel Further Maths, Unit 38

20 questions

Written by Revision Ninja · Last reviewed 11 October 2026

In partnership with Revision Ninja

Lesson 3D.4.3, Critical path algorithm: 20 multiple choice questions for the Pearson Edexcel Further Maths (9FM0), Unit 38: Critical path analysis, written with Revision Ninja.

Host it live on the board and students join with a game code on their own devices, or revise alone with Free Play. The answers are revealed in the game.

Host this setFree Play

The 20 questions

  1. Critical activities are those with

    • no predecessors
    • maximum total float
    • zero total float
    • the longest duration

  2. What does the forward pass in the critical path algorithm compute?

    • earliest event times
    • critical activities
    • latest event times
    • total float

  3. What does the backward pass in the critical path algorithm compute?

    • earliest event times
    • independent float
    • project start
    • latest event times

  4. What is defined as a longest path from start to finish?

    • dummy path
    • critical path
    • residual path
    • float path

  5. How is the earliest event time calculated during a forward pass?

    • Average value
    • Minimum incoming value
    • Total sum
    • Maximum incoming value

  6. During a backward pass, how is the latest event time calculated?

    • average outgoing value
    • minimum outgoing value
    • maximum outgoing value
    • difference of values

  7. On an activity network, what value represents the total project duration?

    • Earliest finish time
    • Latest finish time
    • Free float
    • Total float

  8. Start node 0 has earliest time 0. Activity 0-1 takes 3, 0-2 takes 5, 1-3 takes 4, 2-3 takes 1 and 3-4 takes 6. What is the project duration?

    • 7
    • 13
    • 18
    • 12

  9. In the same network, the latest time at node 3 is 7. What is the latest time at node 2, where the activity 2-3 takes 1?

    • 6
    • 8
    • 7
    • 5

  10. In the same network (durations 0-1: 3, 0-2: 5, 1-3: 4, 2-3: 1, 3-4: 6), which activities form the critical path?

    • 0-1, 2-3 and 3-4
    • 0-1, 1-3 and 3-4
    • 0-2 and 2-3 only
    • 0-2, 2-3 and 3-4

  11. In the same network, what is the total float of activity 0-2, which takes 5, given earliest time 0 at node 0 and latest time 6 at node 2?

    • 1
    • 0
    • 5
    • 6

  12. If an event has equal earliest and latest event times, what type of event is it?

    • Critical event
    • Redundant event
    • Sink event
    • Dummy event

  13. An activity has earliest start 2, duration 4 and its head event has latest time 9. What is its total float?

    • 5
    • 1
    • 3
    • 0

  14. An event has two incoming activities: one from node 0 (earliest time 0, duration 4) and one from node 1 (earliest time 2, duration 7). What is the earliest time at this event?

    • 4
    • 9
    • 6
    • 11

  15. A node has outgoing activities to node 5 (duration 3, latest time 12) and to node 6 (duration 4, latest time 10). What is the latest time at this node?

    • 9
    • 6
    • 12
    • 7

  16. How many critical paths can a network have?

    • one or more
    • none
    • exactly two
    • exactly one

  17. What is the name given to an activity with zero total float?

    • Redundant activity
    • Independent activity
    • Dummy activity
    • Critical activity

  18. An activity runs from node 2 to node 3 and takes 4. Node 2 has earliest time 8, and node 3 has latest time 12. What is the total float of this activity?

    • 4
    • 1
    • 2
    • 0

  19. Which process is used to calculate the latest event times in an activity network?

    • Simplex algorithm
    • Backward pass
    • Kruskal's algorithm
    • Forward pass

  20. A network has edges 0-1 (2), 0-2 (6), 1-3 (5), 2-3 (1), 3-4 (4) and 1-2 (3). What is the project duration?

    • 11
    • 7
    • 12
    • 9

All Pearson Edexcel Further Maths quizzes