Determine the critical path and the expected completion, Data Structure & Algorithms

The information in the table below is available for a large fund-raising project.
a. Determine the critical path and the expected completion time of the project.
b. Plot the total project cost, starting from day 1 to the expected completion date of the project, assuming the earliest start times for each activity. Compare that result to a similar plot for the latest start times. What implication does the time differential have for cash flows and project scheduling?

Activity             Activity Time (days)           Activity Costs ($)               Immediate Predecessor(s)
A                                3                                      100                                  -
B                                4                                      150                                  -
C                                2                                      125                                 A
D                                5                                      175                                 B
E                                 3                                     150                                  B
F                                 4                                      200                                  C,D

Posted Date: 3/30/2013 7:06:42 AM | Location : United States







Related Discussions:- Determine the critical path and the expected completion, Assignment Help, Ask Question on Determine the critical path and the expected completion, Get Answer, Expert's Help, Determine the critical path and the expected completion Discussions

Write discussion on Determine the critical path and the expected completion
Your posts are moderated
Related Questions
How can the third dimension be displayed on the screen The main problem in visualization is the display of three-dimensional objects and scenes on two-dimensional screens. How

Breadth-first search starts at a given vertex h, which is at level 0. In the first stage, we go to all the vertices that are at the distance of one edge away. When we go there, we

Give example of assertion and abstract data type For illustration, consider Natural ADT whose carrier set is the set of non-negative integers and whose operations are the usual

How many recursive calls are called by the naïve recursive algorithm for binomial coefficients, C(10, 5) and C(21, 12) C(n,k){c(n-1,k)+c(n-1,k-1) if 1 1 if k = n or k = 0

Q. Write down an algorithm to convert an infix expression into the postfix expression.     Ans. Algo rithm to convert infix expression to post fix expression is given as

So far, we now have been concerned only with the representation of single stack. What happens while a data representation is required for several stacks? Let us consider an array X

the above title please send give for the pdf file and word file

Q. Make the 11 item hash table resulting from hashing the given keys: 12, 44, 13, 88, 23, 94, 11, 39, 20, 16 and 5 by making use of the hash function h(i) = (2i+5) mod 11.

RGB Model The RGB model is based on the assumption that any desired shade of colour can be obtained by mixing the correct amounts of red, green, and blue light. The exact hues

Q. Explain quick sort? Sort the given array using quick sort method. 24 56 47 35 10 90 82 31