45. In a fictional unconstrained schedule, A takes 3 days then B 4; C runs in parallel for 5; D takes 2 after both B and C. What is the earliest finish?
MediumPlanning & scope
Case
Show model answer
The A-to-B path takes 7 days, while C takes 5. D waits for both and then needs 2 more, so earliest completion is day 9, assuming common start, compatible calendars, and no additional lags or resource constraints.
Check the real logic and capacities before applying the arithmetic to a live plan. Shortening C alone would not improve this stated finish because the A-to-B path remains longer.
What interviewers listen for
- Calculate paths 7 and 5 days
- Add 2 after the later path for 9 days
- State calendar, logic, and resource assumptions