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.

Explanation:

The critical path is A-B-C, with a term of 15 minutes. You don't need to be knowledgeable in computer lingo to make sense of this one (as I made sense of it absent a lot of data on that half of the condition). Here's the manner by which I made sense of this.   The main thing I saw was that "predecessor" was utilized, which implies something precedes the other thing. That provided me the primary insight that A precedes B and C, and that B must precede C. Then, I just included the term times for the three ways, which allowed me 15 minutes.

Idon’t have any classes like this