12
The Critical Path Method This presentation is part of Ace the PMP Exam
The Critical Path
Method
This presentation is part ofAce the PMP Exam
A Simple Method to Determine the Critical Path
The critical path is the longest path in a network diagram, and therefore determines the shortest time that it will take to complete a project.
This presentation illustrates a simple method to determine the critical path.
A Simple Method to Determine the Critical Path
To use the simple method you look at all the different paths in the schedule, add the durations, and determine which is the longest.
The following example demonstrates the concept and will enable you to quickly answer some of the simpler questions on the PMP® exam.
A Simple Method to Determine the Critical Path
Touch the screen to continue
A2A2
D3D3
F3F3
B8B8
C4C4
E2E2
StartStart EndEnd
There are four possible paths in this network diagram: A D F➞ ➞ , B F➞ , B E➞ , and C E➞ .We will follow each path to determine its length.
Touch the screen to continue
A Simple Method to Determine the Critical Path
Path 1: A D F = 2 + 3 + 3 = 8➞ ➞
A2A2
D3D3
F3F3
B8B8
C4C4
E2E2
StartStart EndEnd
A2A2
D3D3
F3F3
Touch the screen to continue
There are four possible paths in this network diagram: A D F➞ ➞ , B F➞ , B E➞ , and C E➞ .We will follow each path to determine its length.
Path 2: B F = 8 + 3 = 11➞Path 1: A D F = 2 + 3 + 3 = 8➞ ➞
A2A2
D3D3
F3F3
B8B8
C4C4
E2E2
StartStart EndEnd
F3F3
B8B8
Touch the screen to continue
Path 1: A D F = 2 + 3 + 3 = 8➞ ➞
A2A2
D3D3
F3F3
Path 2: B F = 8 + 3 = 11➞Path 3: B E = 8 + 2 = 10➞
Path 1: A D F = 2 + 3 + 3 = 8➞ ➞
A2A2
D3D3
F3F3
B8B8
C4C4
E2E2
StartStart EndEnd
B8B8
E2E2
Touch the screen to continue
F3F3
B8B8
Path 2: B F = 8 + 3 = 11➞
Path 1: A D F = 2 + 3 + 3 = 8➞ ➞Path 2: B F = 8 + 3 = 11➞Path 3: B E = 8 + 2 = 10➞Path 4: C E = 4 + 2 = 6➞
A2A2
D3D3
F3F3
B8B8
C4C4
E2E2
StartStart EndEnd
C4C4
E2E2
Touch the screen to continue
B8B8
E2E2
Path 3: B E = 8 + 2 = 10➞
Path 2: B F = 8 + 3 = 11➞
A2A2
D3D3
F3F3
B8B8
C4C4
E2E2
StartStart EndEnd
Path 3: B E = 8 + 2 = 10➞Path 2: B F = 8 + 3 = 11 (the longest path)➞
Path 4: C E = 4 + 2 = 6➞
Path 1: A D F = 2 + 3 + 3 = 8➞ ➞
A2A2
D3D3
C4C4
E2E2
StartStart EndEnd
F3F3
B8B8
End
C4C4
E2E2
Path 4: C E = 4 + 2 = 6➞
A Simple Method to Determine the Critical Path
That was a simple method of determining the critical path in a network diagram.
For a systematic way of determining the critical path, see the Forward and Backward Pass video in this series.
The Critical Path
Method
This presentation is part ofAce the PMP Exam
