1. ## Set Theory

Any explanation with regards to solutions would be GREATLY appreciated.

2. ## Re: Set Theory

I think I have managed to determine that the answer to number 1 is C...

3. ## Re: Set Theory

I also think I understand number 2... If someone could explain how to calculate the total time, and explain a critical path?

4. ## Re: Set Theory

Note we have a 3-way branch at A, and 2-way branchings at C and D, all other nodes have no choice of path.

So our possible paths start:

AB
AC

the first path has only one completion:

ABEH

the next path can go one of two ways:

ACE...
ACF...

after that, we can only complete each of THOSE one way:

ACEH
ACFH

finally, we can go one of two ways after AD:

and these both can be completed only one way:

ADGH, giving 5 paths in all:

ABEH
ACEH
ACFH

To compute the time required for completing the task, we add the times required for each individual task:

Time for ABEH, for example, is 3+7+8+5 = 23 days.

Calculate the times for the other 4 complete task paths, the critical path is the one with the shortest completion time.

To find the critical path for F, treat F as if it were the "end-stage" of the assembly product.