CRITICAL PATH ANALYSIS
BY: QASIM SHAMIM
QUESTION 1
QUESTION 1
PRACTICE QUESTION 1
IMPORTANT FORMULAS
 Earliest Start Time: the earliest an activity can be started
 Latest Finish Time: the maximum / latest time an activity can finish without delaying
the overall project
IMPORTANT DEFINITIONS
 Total Float: The amount of time an activity can be delayed without delaying the
whole project duration.
 Free Float: The length of time an activity can be delayed without delaying the start of
the following activities.
IMPORTANT FORMULAS
 Total Float = LFT (following node) – Duration – EST (previous node)
 Free Float = EST (following node) – Duration – EST (previous node)
ANOTHER QUESTION
ANOTHER QUESTION
ANSWER 2