Tasks A, B, and C have a duration of two days. Task D has a duration of three days, and Task E has duration of four days. Task A starts on Day 1, and Task B starts on Day 2. Task C starts after Task…

The correct answer is B. A, C, E. Calculate each path through the network: Task A starts Day 1 and finishes end of Day 2. Task C (successor of A) starts Day 3 and finishes end of Day 4. Task D (successor of C) starts Day 5 and finishes end of Day 7 - path A→C→D = 7 days. Task E (successor of C) starts Day 5 and…

Project management concepts

Question

Tasks A, B, and C have a duration of two days. Task D has a duration of three days, and Task E has duration of four days. Task A starts on Day 1, and Task B starts on Day 2. Task C starts after Task A. Tasks D and E start after Task C. Which of the following is the critical path if Task B starts on Day 3?

Options

AA, C, D
BA, C, E
CA, D, E
DB, C, E

How the community answered

(52 responses)

A
4% (2)
B
65% (34)
C
19% (10)
D
12% (6)

Explanation

Calculate each path through the network: Task A starts Day 1 and finishes end of Day 2. Task C (successor of A) starts Day 3 and finishes end of Day 4. Task D (successor of C) starts Day 5 and finishes end of Day 7 - path A→C→D = 7 days. Task E (successor of C) starts Day 5 and finishes end of Day 8 - path A→C→E = 8 days. Task B starting Day 3 finishes end of Day 4; since B has no listed successors that extend beyond Day 8, it does not define the critical path. The longest path through the network is A→C→E at 8 days, which is the critical path. Option A (A,C,D) is only 7 days. Options C and D include invalid dependency chains not supported by the given logic.

Topics

#critical path method#schedule analysis#task dependencies#network diagram

Community Discussion

No community discussion yet for this question.

Full PK0-004 Practice