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
Example 1:  Following are Simple sequence of statements Statement 1;  Statement 2; ... ... Statement k; The entire time can be found out through adding the times for

discuss the operating system under the following: MONOLITHIC SYSTEM,LAYER SYSTEM AND VIRTUAL MACHINES

The Ruby Programming Language Although data structures and algorithms we study aren't tied to any program or programming language, we need to write particular programs in speci

Linear search is not the most efficient way to search an item within a collection of items. Though, it is extremely simple to implement. Furthermore, if the array elements are arra

Example of pre order traversal: Reading of a book, since we do not read next chapter unless we complete all sections of previous chapter & all its sections. Figure  : Rea

Q. Write  down the  algorithm  to  insert  an  element  to  a  max-heap  which  is  represented sequentially.           Ans: The algorithm to insert an element "newkey" to

Explain in detail the algorithmic implementation of multiple stacks.

You have to design a framework of a Genetic Algorithm (GA) with basic functionality. The basic functionality includes representation, recombination operators, tness function and se

Explain in detail the algorithmic implementation of multiple stacks.

A Stack has an ordered list of elements & an array is also utilized to store ordered list of elements. Therefore, it would be very simple to manage a stack by using an array. Thoug