Loading subjects
Critical Path Analysis · Part 1 of 3
3 exam-style questions with model answers, plus 4 quick multi-choice questions — every question on this part of the standard, grouped by the 1 page of notes they come from.
Write a full answer before you reveal the model one. That comparison is where the learning happens.
A project has activities: P (4 days, no predecessor), Q (3, after P), R (6, after P), S (2, after Q), T (5, after R and S). Describe the network structure, state how many nodes it needs, and number them.
A project has activities: A (2, no predecessor), B (5, no predecessor), C (4, after A), D (3, after A and B), E (6, after C and D). Explain why a dummy activity is required, where it must go, and what would go wrong without it.
Explain why a project network must contain no cycles, and devise a systematic test that detects whether a given precedence table can be drawn as a valid network. Apply it to the table: A (—), B (A), C (B, E), D (C), E (D).