The answer is 12 days. This is correct because the critical path is the longest sequence of dependent tasks in a network diagram, and its duration determines the shortest possible project completion time. By summing the durations along path A→C→E→F (3 + 4 + 3 + 2), you reach 12 days, which exceeds all other paths in the diagram. On the CompTIA Project+ PK0-005 exam, this type of critical path duration calculation from a network diagram tests your ability to identify the longest path rather than the most tasks, a common trap where candidates mistakenly choose a path with more activities but shorter total time. A reliable memory tip is to always add, not count: the critical path is about total duration, not the number of steps.
PK0-005 Project Management Concepts Practice Question
This PK0-005 practice question tests your understanding of project management concepts. Read the scenario carefully and evaluate each option against the stated constraints before committing to an answer. After answering, compare your reasoning against the explanation and wrong-answer breakdown below. Once you have made your selection, read the full explanation to reinforce the concept and understand why each distractor is designed to mislead on exam day.
Exhibit
Refer to the following project schedule:
Task ID | Duration | Predecessors
A | 5 days | None
B | 3 days | A
C | 4 days | A
D | 2 days | B, C
E | 1 day | D
What is the duration of the critical path?
Refer to the exhibit. What is the duration of the critical path?
Refer to the following project schedule:
Task ID | Duration | Predecessors
A | 5 days | None
B | 3 days | A
C | 4 days | A
D | 2 days | B, C
E | 1 day | D
What is the duration of the critical path?
A
11 days
Why wrong: 11 days is the duration of path A-B-D-E, but the critical path is the longest, which is A-C-D-E at 12 days.
B
10 days
Why wrong: 10 days does not match any path duration in the schedule.
C
12 days
Path A-C-D-E has a total duration of 12 days, making it the critical path.
D
9 days
Why wrong: 9 days does not match any path duration in the schedule.
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
12 days
The critical path is the longest path through the network diagram, determining the shortest possible project duration. By summing the durations of tasks along the path A→C→E→F (3+4+3+2 = 12 days), we find that 12 days is the correct duration. No other path exceeds this total, making option C correct.
Key principle: Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
✗
11 days
Why it's wrong here
11 days is the duration of path A-B-D-E, but the critical path is the longest, which is A-C-D-E at 12 days.
✗
10 days
Why it's wrong here
10 days does not match any path duration in the schedule.
✓
12 days
Why this is correct
Path A-C-D-E has a total duration of 12 days, making it the critical path.
Related concept
Read the scenario before looking for a memorised answer.
✗
9 days
Why it's wrong here
9 days does not match any path duration in the schedule.
Common exam traps
Common exam trap: answer the scenario, not the keyword
The trap here is that candidates often mistakenly sum the durations of tasks along a non-critical path (e.g., A→B→D→F = 11 days) or misread task durations, leading them to select 11 or 10 days instead of correctly identifying the longest path of 12 days.
Detailed technical explanation
How to think about this question
In project management, the critical path method (CPM) identifies the sequence of tasks with zero float, meaning any delay on these tasks directly delays the project. The exhibit likely uses a precedence diagramming method (PDM) with finish-to-start dependencies; the critical path is calculated by performing a forward pass (earliest start/finish) and backward pass (latest start/finish) to determine total float. In real-world scenarios, failing to identify the correct critical path can lead to misallocated resources and missed deadlines, especially when multiple paths have near-critical float.
KKey Concepts to Remember
Read the scenario before looking for a memorised answer.
Find the constraint that changes the correct option.
Eliminate answers that are true in general but not in this case.
TExam Day Tips
→Watch for words such as best, first, most likely and least administrative effort.
→Review why wrong options are wrong, not only why the correct option is correct.
Key takeaway
Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Real-world example
How this comes up in practice
A small business has 20 workstations on the 192.168.1.0/24 network and one public IP from its ISP. The router uses PAT (NAT overload) so all 20 devices share one public address using different source ports. NAT questions test whether you understand the four address terms and which direction each translation applies.
What to study next
Got this wrong? Here's your next step.
Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.
Project Management Concepts — This question tests Project Management Concepts — Read the scenario before looking for a memorised answer..
What is the correct answer to this question?
The correct answer is: 12 days — The critical path is the longest path through the network diagram, determining the shortest possible project duration. By summing the durations of tasks along the path A→C→E→F (3+4+3+2 = 12 days), we find that 12 days is the correct duration. No other path exceeds this total, making option C correct.
What should I do if I get this PK0-005 question wrong?
Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.
What is the key concept behind this question?
Read the scenario before looking for a memorised answer.
About these practice questions
Courseiva creates original exam-style practice questions with explanations and wrong-answer analysis. It does not publish real exam questions, exam dumps, or protected exam content. Learn why practice questions differ from exam dumps →
These questions test the same concept from different angles. Work through them to make sure you can recognise it however the exam phrases it.
Variation 1. What is the critical path duration?
easy
✓ A.22 days
B.23 days
C.19 days
D.18 days
Why A: The critical path is the longest sequence of dependent tasks in a project schedule, determining the shortest possible project duration. By summing the durations along the critical path (e.g., tasks A→C→E→G with durations 5, 6, 7, and 4 days respectively), the total is 22 days. Any delay on this path directly extends the project completion date.
Last reviewed: Jun 24, 2026
Question Discussion
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
This PK0-005 practice question is part of Courseiva's free CompTIA certification practice question bank. Courseiva provides original exam-style practice questions with explanations, topic-based practice, mock exams, readiness tracking, and study analytics to help learners prepare for the PK0-005 exam.
Question Discussion
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
Sign in to join the discussion.