ITPEC FE Subject A October 2025 Question 41
ITPEC FE Subject A October 2025 — Question 41 of 60
The critical path is the longest path through the network. Dummy activities (dashed arrows) have duration 0 but represent dependencies.
All paths from start to finish:
| Path | Calculation | Total |
|---|---|---|
| A → C → E → H | 15 + 0 + 15 + 10 | 40 |
| A → C → F → G | 15 + 0 + 15 + 5 | 35 |
| B → E → H | 10 + 15 + 10 | 35 |
| B → F → G | 10 + 15 + 5 | 30 |
The longest path is A → C → E → H = 40 days.
Why not others:
- (b) A, C, F, G — 35 days, shorter because G = 5 instead of H = 10
- (c) B, E, H — 35 days, shorter because B = 10 vs A + C = 15
- (d) B, F, G — 30 days, the shortest path
Key rule: Critical path = longest path in the network; dummy activities count as 0 duration but enforce predecessor relationships.
AI-generated — may contain errors
The original exam layout is preserved in the image so diagrams, formulas, tables, and code remain accurate.
This question comes from an official ITPEC past paper. ITPEC Practice is an independent study tool and is not affiliated with ITPEC. See the official FE past-paper collection or Report an issue.