easyMultiple ChoiceObjective-mapped

PK0-005 Critical Path Practice Question

Exhibit

Refer to the exhibit.
Project Schedule (in days):
Task A (10d)
Task B (5d, predecessor: A)
Task C (8d, predecessor: A)
Task D (4d, predecessors: B, C)

What is the critical path duration?

⚠ Common exam trap

The trap here is that candidates often mistakenly sum all task durations or include tasks with positive float, leading to an inflated or deflated duration, rather than identifying the single longest path through the network diagram.

Answer choices

Why each option matters

Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.

Correct answer & explanation

✓

22 days

The critical path is the longest sequence of dependent tasks in a project schedule, determining the shortest possible project duration. For this project, the critical path is A→C→D, with durations summing to 22 days. Any delay on this path directly extends the project completion date.

Answer analysis

Option-by-option breakdown

For each option: why learners choose it and why it is or isn't the right answer here.

✓
22 days
Why this is correct
Correct. Path A-C-D takes 22 days, the longest.
✗
23 days
Why it's wrong here
No path has a duration of 23 days.
✗
19 days
Why it's wrong here
This is the duration of path A-B-D, but not the longest.
✗
18 days
Why it's wrong here
This does not account for all dependencies.

Go deeper

PK0-005 Critical Path Practice Question

Exhibit

Why each option matters

Option-by-option breakdown

Related to this question