hardMultiple Choice
PK0-005 Practice Question: A project manager wants to analyze the project…
A project manager wants to analyze the project schedule to identify the longest path of dependent tasks. Which technique should be used?
⚠ Common exam trap
Watch out — candidates often confuse PERT analysis with CPM because both use network diagrams, but PERT is for probabilistic duration estimation while CPM is for deterministic critical path identification.
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
✓
Critical path method
The critical path method (CPM) is used to identify the longest sequence of dependent tasks in a project schedule, which determines the minimum project duration. By calculating early start, early finish, late start, and late finish for each task, CPM highlights the path with zero total float, meaning any delay on this path directly delays the project. This technique is specifically designed for analyzing task dependencies and durations to find the critical path.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✓
Critical path method
Why this is correct
The critical path method calculates the longest sequence of dependent activities through the network diagram, directly satisfying the stem's aim of identifying that longest path. Float calculations then reveal which tasks can slip without delaying the project end date, unlike resource levelling or crashing, which adjust rather than identify the path.
- ✗
PERT analysis
Why it's wrong here
PERT analysis estimates durations using optimistic, pessimistic and most likely values to compute weighted averages; it does not trace the longest dependent chain. It tempts for schedule estimation, but identifying the longest path requires critical path method forward and backward pass calculations.
- ✗
Gantt chart
Why it's wrong here
A Gantt chart displays tasks as bars against a timeline, showing durations and overlaps visually but performing no dependency path calculation. It tempts as a scheduling visualisation tool, yet the longest dependent sequence is derived through critical path method network analysis.
- ✗
Monte Carlo simulation
Why it's wrong here
Monte Carlo simulation runs probabilistic iterations over duration ranges to model schedule risk and confidence levels, not to trace a deterministic longest path. It tempts for quantitative schedule risk analysis, but critical path method identifies the longest dependent task chain.
Go deeper
Related to this question
About these practice questions
One of 954 original PK0-005 practice questions on Courseiva, each with a full explanation and wrong-answer analysis — not exam dumps or protected exam content. Learn why practice questions differ from exam dumps →
JA
Written by Johnson Ajibi, MSc IT Security
Senior Network & Security Engineer · founder of Courseiva
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.