Lesson DE1-DE3
DE1-DE3 Activity networks and critical paths Quiz: AQA Further Maths, Unit 5
20 questions
In partnership with Revision Ninja
Lesson DE1-DE3, Activity networks and critical paths: 20 multiple choice questions for the AQA Further Maths (7367), Unit 5: Optional application 3: discrete mathematics, 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.
The 20 questions
-
In an activity-on-node network, what do the nodes represent?
- Activities
- Float values
- Events
- Precedences
-
In critical path analysis, which pass calculates the earliest start time of an activity?
- Forward pass
- Backward pass
- Float pass
- Critical pass
-
What is the total float of a critical activity in a project network?
- 1
- 0
- Equal to duration
- Infinite
-
Which path through a project network determines the minimum completion time?
- Longest path
- Most activities
- Shortest path
- Highest float
-
What does an activity's total float measure?
- Total duration
- Earliest start
- Spare time available
- Minimum duration
-
Activities: A (3, no predecessors), B (4, none), C (2, after A), D (5, after B), E (3, after C and D). What is the minimum duration of the project?
- 9
- 11
- 14
- 12
-
Activities: A (3, no predecessors), B (4, none), C (2, after A), D (5, after B), E (3, after C and D). What is the earliest start time of activity E?
- 8
- 9
- 5
- 12
-
Activities: A (3, no predecessors), B (4, none), C (2, after A), D (5, after B), E (3, after C and D). Which activities form the critical path?
- B, D and E
- A, C and E
- B, C and E
- A, D and E
-
Activities: A (3, no predecessors), B (4, none), C (2, after A), D (5, after B), E (3, after C and D). What is the total float of activity A?
- 4
- 0
- 7
- 3
-
Activities: A (3, no predecessors), B (4, none), C (2, after A), D (5, after B), E (3, after C and D). What is the total float of activity C?
- 4
- 5
- 0
- 2
-
An activity with a float of 4 is delayed by 3 units. What happens to project duration?
- Unchanged
- Increases by 1
- Increases by 3
- Decreases by 3
-
A critical activity in a project with duration 12 is delayed by 1 unit. What is the new duration?
- 12
- 13
- 11
- 14
-
Activities: A (3, no predecessors), B (4, none), C (2, after A), D (5, after B), E (3, after C and D). What is the latest start time of activity D?
- 4
- 5
- 0
- 9
-
Activities: A (3, no predecessors), B (4, none), C (2, after A), D (5, after B), E (3, after C and D). What is the latest start time of activity B?
- 0
- 2
- 1
- 4
-
Activities: A (3, no predecessors), B (4, none), C (2, after A), D (5, after B), E (3, after C and D). What is the total float of activity E?
- 9
- 12
- 3
- 0
-
In critical path analysis, what is calculated during the backward pass?
- Latest times
- Activity durations
- Float values
- Earliest times
-
Why is the minimum project duration equal to the length of the longest path?
- Precedence requirements
- Shortest path rules
- Zero float rules
- Resource constraints
-
Paths ACE (8) and BDE (12) exist. If A increases by 5, what is the new critical path duration?
- 15
- 17
- 12
- 13
-
What is the total float of every activity lying on a critical path?
- Always positive
- Always negative
- Always zero
- Equal to duration
-
Activities: A (3, no predecessors), B (4, none), C (2, after A), D (5, after B), E (3, after C and D). If the duration of D is increased from 5 to 6, what is the new minimum project duration?
- 14
- 13
- 11
- 12
Related quizzes
- Graph language, Eulerian graphs and Euler's formula Quiz · DA1-DA3 · 20 questions
- Planarity, complete and bipartite graphs Quiz · DA4-DA5 · 20 questions
- Trees and isomorphism of graphs Quiz · DA6-DA7 · 20 questions
- Network language, spanning trees and route inspection Quiz · DB1-DB3 · 20 questions
- Travelling salesperson bounds and refining network models Quiz · DB4-DB5 · 20 questions
- Flows, cuts and the maximum flow-minimum cut theorem Quiz · DC1-DC3 · 20 questions
- Supersources, augmenting flows and capacities Quiz · DC4-DC7 · 20 questions
- Formulating and solving linear programmes graphically Quiz · DD1-DD2 · 20 questions
- The Simplex algorithm Quiz · DD3-DD4 · 20 questions
- Refining models, Gantt charts and resource levelling Quiz · DE4-DE6 · 20 questions