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
I=PR/12 numbers of years : Interest Rate up to 1 years : 5.50 Up to 5 years : 6.50 More than 5 year : 6.75 please design an algorithm based on the above information

The class Element represents a single node that can be part of multiple elements on a hotplate and runs in its own thread. The constructor accepts the initial temperature and a hea

How To implement stack using two queues , analyze the running time of the stack operations ?

reverse the order of elements on a stack S using two additional stacks using one additional stack

advanatges of dynamic data structure in programming

Explain about Hidden-surface Hidden-line removal refers to wire-frame diagrams without surface rendering and polygonal surfaces with straight edges. Hidden-surface removal ref

Difference among Prism's and Kruskal's Algorithm In Kruskal's algorithm, the set A is a forest. The safe edge added to A is always a least-weight edge in the paragraph that lin


a) Given a digraph G = (V,E), prove that if we add a constant k to the length of every arc coming out from the root node r, the shortest path tree remains the same. Do this by usin

* Initialise d & pi* for each vertex v within V( g ) g.d[v] := infinity  g.pi[v] := nil g.d[s] := 0; * Set S to empty * S := { 0 }  Q := V(g) * While (V-S)