Lesson DE4-DE6
DE4-DE6 Refining models, Gantt charts and resource levelling Quiz: AQA Further Maths, Unit 5
20 questions
In partnership with Revision Ninja
Lesson DE4-DE6, Refining models, Gantt charts and resource levelling: 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
-
What type of diagram displays project activities as horizontal bars along a time axis?
- Network diagram
- Distance-time graph
- Gantt chart
- Resource histogram
-
What chart shows total resource demand over time for a project schedule?
- Precedence network
- Resource histogram
- Activity box
- Gantt chart
-
What process uses float to smooth out resource demand without delaying a project?
- Resource levelling
- Backward pass
- Forward pass
- Crash analysis
-
What type of solution does a heuristic method produce in resource levelling?
- Worst-case bounds only
- Guaranteed optimal solution
- Mathematically exact solution
- Good but non-optimal
-
How should a critical path model be refined if real-world resource availability is limited?
- Add resource limits
- Increase float times
- Remove dependency arcs
- Reduce activity durations
-
Activities: A (3, no predecessors), B (4, none), C (2, after A), D (5, after B), E (3, after C and D). Workers: A 2, B 1, C 2, D 2, E 1, all started at earliest start times. What is the earliest time at which activity E can start in the early start schedule?
- Time 5
- Time 9
- Time 4
- Time 12
-
In an early-start Gantt chart, how is total float typically represented for an activity?
- Dotted arrow
- Shaded box
- Vertical bar
- Line extension
-
Activities: A (3, no predecessors), B (4, none), C (2, after A), D (5, after B), E (3, after C and D). Workers: A 2, B 1, C 2, D 2, E 1, all started at earliest start times. What is the peak number of workers needed at any time in the early start schedule?
- 6
- 4
- 3
- 5
-
Activities C and D overlap between times 4 and 5. In which interval is peak demand?
- Times 4 to 5
- Times 0 to 3
- Times 5 to 9
- Times 3 to 4
-
Activities: A (3, no predecessors), B (4, none), C (2, after A), D (5, after B), E (3, after C and D). Workers: A 2, B 1, C 2, D 2, E 1, all started at earliest start times. What is the total number of worker-days needed for the whole project?
- 12
- 27
- 30
- 24
-
Why is a non-critical activity moved later within its total float during resource levelling?
- Decrease duration
- Reduce peak demand
- Increase total float
- Extend project length
-
If peak demand is 4 workers but only 3 are available, what is the schedule?
- Levellable
- Critical
- Optimal
- Infeasible
-
What happens to the overall project duration if a critical activity is delayed?
- Float increases
- Duration increases
- Duration decreases
- Duration stays unchanged
-
During resource levelling without delaying the project, an activity must be shifted within what?
- Its total float
- Its worker allocation
- Its late finish
- Its duration
-
What total float value is shown on a Gantt chart for a critical activity?
- Positive
- Variable
- Infinite
- Zero
-
If a project model incorrectly assumes a worker can perform two parallel tasks, what refinement is needed?
- Ignore overlap
- Increase float
- Add worker constraints
- Reduce task durations
-
What is the primary purpose of constructing a resource histogram in critical path analysis?
- Identify resource overloads
- Estimate activity costs
- Calculate project float
- Find critical path
-
Activity D needs 2 workers for 5 days. How many worker-days does D require?
- 5
- 10
- 2
- 7
-
Two parallel activities need 3 workers each, but only 4 exist. What action is required?
- Halve worker demand
- Combine both activities
- Delay one activity
- Cancel the project
-
What is a key feature of heuristic resource levelling?
- Gives practical schedules
- Changes precedence relations
- Guarantees optimal schedules
- Ignores resource limits
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
- Activity networks and critical paths Quiz · DE1-DE3 · 20 questions