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
In this unit, we described about the data structure Queue. It had two ends. One is front from where the elements can be removed and the other is rear where the elements can be inse

Q. Explain w hat are the stacks? How can we use the stacks  to check whether an expression is correctly parentheses or not. For example (()) is well formed but (() or )()( is not w

The data structure needed for Breadth First Traversal on a graph is Queue

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

What is wrong with the following algorithm for sorting a deck of cards (considering the basic properties of algorithms)? I. Put the cards together into a pile II. For each ca

circular queue using c

the voltage wave forms are applied at the inputs of an EX-OR gate. determine the output wave form

extra key inserted at end of array is called

The Space - Time Trade Off The best algorithm to solve a given problem is one that needs less space in memory and takes less time to complete its implementation. But in practic

Q. What do you mean by the best case complexity of quick sort and outline why it is so. How would its worst case behaviour arise?