A project has five tasks. Tasks can run at the same time unless one depends on another. A: 2 days, no dependency B: 3 days, after A C: 4 days, after A D: 2 days, after both B and C E: 1 day, after D What is the earliest the project can finish?
Answer: C: 9 days
Why: Work out when each task can finish. A ends on day 2. B and C both start then: B ends on day 5 and C on day 6. D needs both, so it waits for C and ends on day 8. E ends on day 9. The longest chain (A, C, D, E) sets the finish. 12 adds up every task as if they ran one after another, and 8 follows B instead of the slower C.
Want more like this? Open it in the question bank to save your answer and move on to the next one.
Candidates describe scheduling questions in the timed reasoning block of BCG's Consulting Career Assessment (CCA): tasks with dependencies, a deadline, and a question about the earliest finish or what can slip. BCG doesn't publish the question types; this one follows what candidates report.
The method that works every time: write down when each task can start and finish, and remember that a task waiting on two others starts only when the later one ends. The longest chain sets the finish.
SolveForge is an independent practice tool and is not affiliated with, endorsed by, or connected to Boston Consulting Group or SHL. This question was written by us from public descriptions of the test. It is not an SHL item or a real BCG question, and practising here does not guarantee any assessment result.