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
i need the full concept of it... please can anyone provide

Ask question #Minima binary search tree is used to locate the number 43 which of the following probe sequences are possible and which are not? explainum 100 words accepted#

The maximum degree of any vertex in a simple graph with n vertices is (n-1) is the maximum degree of the vertex in a simple graph.

1. For the ER diagram you created in assignment, the artefact of the conceptual database design, map the ER model into the relational model according to how it was designed in the

A mathematical-model with a collection of operations described on that model is known as??? Abstract Data Type

It offers an effective way to organize data while there is a requirement to access individual records directly. To access a record directly (or random access) a relationship is

Read the scenario (Pickerings Properties). (a) List the functions of the system, as perceived by an external user. (b) List the external entities. Note that because we are mo

Write a program to simulate searching over a hashed file, with different assumptions for the sizeof file pages.Write a program to perform equality search operations on the hashed f

Consistent Heuristic Function - Graph Search Recall the notions of consistency and admissibility for an A* search heuristic. a. Consider a graph with four nodes S, A, B, C,

Q. What do you understand by the term Binary Tree? What is the maximum number of nodes which are possible in a Binary Tree of depth d. Explain the terms given below with respect to