The presentation is part of Ace the PMP Exam, available on the iBookstore. Go to http://Aceitguides.com for more information. 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. The following example demonstrates the concept and will enable you to quickly answer some of the simpler questions on the PMP® exam.

1. The Critical
Path Method
This presentation is part of
Ace the PMP Exam

2. 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.

3. 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.

4. A Simple Method to
Determine the Critical Path
Determine the Critical Path
Touch the screen to continue

5. 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.
A D F
A Simple Method to
2 3 3
Determine the Critical Path
B
8
Start E End
2
C
4
Touch the screen to continue

6. Path 1: A➞D➞F = 2 + 3 + 3 = 8
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.
A D F
2 3 3
B
8
Start E End
2
C
4
Touch the screen to continue

7. Path 1: A➞D➞F = 2 + 3 + 3 = 8
Path 2: B➞F = 8 + 3 = 11
A D F
2 3 3
B
8
Start E End
2
C
4
Touch the screen to continue

8. Path 1: A➞D➞F = 2 + 3 + 3 = 8
Path 2: B➞F = 8 + 3 = 11
Path 3: B➞E = 8 + 2 = 10
A D F
2 3 3
B
8
Start E End
2
C
4
Touch the screen to continue

9. 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
A D F
2 3 3
B
8
Start E End
2
C
4
Touch the screen to continue

10. Path 1: A➞D➞F = 2 + 3 + 3 = 8
Path 2: B➞F = 8 + 3 = 11 (the longest path)
Path 3: B➞E = 8 + 2 = 10
Path 4: C➞E = 4 + 2 = 6
A D F
2 3 3
B
8
Start E End
2
C
4
End

11. 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.

12. The Critical
Path Method
This presentation is part of
Ace the PMP Exam