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
Two linked lists are having information of the same type in ascending order. Write down a module to merge them to a single linked list that is sorted merge(struct node *p, stru

what is circular doubly link list?write down the algorithm for insertion of elements in circular doubly link list

The searching technique that takes O (1) time to find a data is    Hashing is used to find a data

Enumerate the Types in Ruby Ruby is a pure object-oriented language, meaning that all types in Ruby are classes, and each value in a Ruby program is an instance of a class. Thi

Create a class "box" that will contain a random integer value v such that O

Write an algorithm for multiplication of two sparse matrices using Linked Lists.

State the ways to construct container taxonomy There are several ways that we could construct our container taxonomy from here; one way that works well is to make a fundamental

In assignment, you have already started the process of designing a database for the Beauty Salon mini-case (enclosed again below), mainly in the phase of conceptual database design

Q. Give the algorithm to build a binary tree where the yields of preorder and post order traversal are given to us.

Q. Explain the complexity of an algorithm?  What are the worst case analysis and best case analysis explain with an example.