Estimate the probability that the noncritical path , Data Structure & Algorithms

An advertising project manager developed the network diagram shown below for a new advertising campagign.  In addition, the manager gathered the time information for each activity, as shown in the below table. 

Estimate the probability that the noncritical path B-F-G will take more than 20 weeks.  Hint:  Subtract from 1.0 the probability that B-F-G will take less than 20 weeks.

Activity                Optimistic           Most likely         Pessimistic         Immediate Predecessor(s)

A             1                              4                              7                              -

B             2                              6                              7                              -

C             3                              3                              6                              B

D             6                              13                           14                              A

E              3                              6                              12                           A,C

F              6                              8                              16                            B

G             1                              5                              6                              E,F

 

Posted Date: 3/30/2013 7:07:37 AM | Location : United States







Related Discussions:- Estimate the probability that the noncritical path , Assignment Help, Ask Question on Estimate the probability that the noncritical path , Get Answer, Expert's Help, Estimate the probability that the noncritical path Discussions

Write discussion on Estimate the probability that the noncritical path
Your posts are moderated
Related Questions
1) preorder, postorder and inorder 2) The main feature of a Binary Search Tree is that all of the elements whose values is less than the root reside into the nodes of left subtr

Program for Linear Search. Program: Linear Search /*Program for Linear Search*/ /*Header Files*/ #include #include /*Global Variables*/ int search; int

Q. What do you understand by the tree traversal? Write down the procedure for traversing a binary tree in preorder and execute it on the following tree.    Ans: Th

Let G=(V,E) be a graph for which all nodes have degree 5 and where G is 5-edge is connected. a) Show that the vector x which is indexed by the edges E and for which xe = 1/5 for

Explain in brief about the Container An entity which holds finitely many other entities. Just as containers such as boxes, baskets, bags, pails, cans, drawers, and so for


write a c++ program to find out the area of a curve y=f(x) between x=a and x=b

Warnock's Algorithm An interesting approach to the hidden-surface problem was presented by Warnock. His method does not try to decide exactly what is happening in the scene but

To delete an element in the list at the end, we can delete it without any difficult. But, assume if we desire to delete the element at the straining or middle of the list, then, we

Algorithm for insertion of any element into the circular queue: Step-1: If "rear" of the queue is pointing at the last position then go to step-2 or else Step-3 Step-2: make