nerdexam
CompTIA

PK0-004 · Question #311

Tasks B and D start after Task A is completed. Task C starts after Tasks B and D are completed. task E starts after Task D is completed. Task H starts after task B is completed. Task G starts after…

The correct answer is B. B. A, B, H, G. The critical path is the longest sequence of dependent tasks in the project network, and path A-B-H-G carries the greatest total duration based on the given task durations.

Tools and documentation

Question

Tasks B and D start after Task A is completed. Task C starts after Tasks B and D are completed. task E starts after Task D is completed. Task H starts after task B is completed. Task G starts after Tasks C and H are completed. Task F starts after Task E is completed. Following are the durations of all tasks:

Which of the following tasks are on the critical path? Task Duration

Options

  • AA, D, C, G
  • BB. A, B, H, G
  • CC. A, D, E, F
  • DA, B, C, G

How the community answered

(50 responses)
  • A
    18% (9)
  • B
    66% (33)
  • C
    4% (2)
  • D
    12% (6)

Why each option

The critical path is the longest sequence of dependent tasks in the project network, and path A-B-H-G carries the greatest total duration based on the given task durations.

AA, D, C, G

Path A-D-C-G exists in the network but has a shorter total duration than A-B-H-G, giving it positive float and removing it from the critical path.

BB. A, B, H, GCorrect

By tracing all possible paths through the network - A-B-C-G, A-B-H-G, A-D-C-G, and A-D-E-F - and summing the task durations along each, path A-B-H-G yields the longest total. Tasks on the critical path have zero float, meaning any delay to A, B, H, or G directly extends the project finish date. The critical path determines the minimum possible project duration, so correctly identifying it is essential for schedule control.

CC. A, D, E, F

Path A-D-E-F exists in the network but its cumulative duration is less than A-B-H-G, so it does not control the project end date.

DA, B, C, G

Path A-B-C-G also passes through A and B but diverges at C instead of H, resulting in a shorter total duration than A-B-H-G and therefore is not the critical path.

Concept tested: Critical path method and network diagram duration analysis

Source: https://www.pmi.org/learning/library/critical-path-scheduling-tools-6783

Topics

#critical path method#CPM#schedule analysis#task dependencies

Community Discussion

No community discussion yet for this question.

Full PK0-004 Practice