What is the critical path and time duration?
A simple CPM network has three activities, A, B, and C. A is an immediate predecessor of B and of C. B is an immediate predecessor of C. The activity durations are A=4, B=3, C=8.
A. The critical path is A-B-C, duration 15. B. The critical path is A-C, duration 12. C. The critical path is A-B-C, duration 13.5 D. The critical path cannot be determined withoutknowing PERT expected activity times. E. The network has no critical path.
The critical path is A-B-C, with a duration of 15 minutes. You don’t have to be well-versed in computer lingo to figure this one out (as I figured it out without much information on that half of the equation). Here’s how I figured this out.
The first thing I noticed was that the word “predecessor” was used, which means something comes before the other thing. That gave me the first clue that A comes before B and C, and that B must come before C. (Read the question again; A is the predecessor of B and C, but B is also the direct predecessor of C.) Then, I just added the duration times for the three paths, which gave me 15 minutes.