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
data structure for multiqueue

Explain divide and conquer algorithms  Divide  and  conquer  is  probably  the  best  known  general  algorithm  design  method.  It   work according to the following general p

For a queue a physical analogy is a line at booking counter. At booking counter, customers go to the rear (end) of the line & customers are attended to several services from the fr


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,

Write an algorithm for searching a key from a sorted list using binary search technique 1.   if (low > high) 2.     return (-1) 3.    mid = (low +high)/2; 4    .if ( X

How many nodes in a tree have no ancestors 1 node in atree have no ancestors.

Implement multiple queues in a single dimensional array. Write algorithms for various queue operations for them.

write short note on algorithms

calculate gpa using an algorithm