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
the voltage wave forms are applied at the inputs of an EX-OR gate. determine the output wave form


Q. Convert the given infix expression into the postfix expression (also Show the steps) A ∗ (B + D)/ E - F(G + H / k ) Ans. Steps showing Infix to Post fix

Assume a complete binary tree T with n nodes where each node has an item (value). Label the nodes of the complete binary tree T from top to bottom & from left to right 0, 1, ..., n

Question 1 What do you mean by Amortization? Question 2 Explain the following Big Oh notation (O) Omega notation (Ω) Theta notation (Θ)   Question 3 Di

explain working of siso-register to store 1011 and show timing diagram &table

If a Dequeue is implemented via arrays, then this will suffer with the similar problems which a linear queue had suffered. Program 8 gives the array implementation of Dequeue.

explanation of doubly linklist

1. In computer science, a classic problem is how to dynamically store information so as to let for quick look up. This searching problem arises frequently in dictionaries, symbol t

Explain the Interfaces in Ruby Recall that in object-oriented programming, an interface is a collection of abstract operations that cannot be instantiated. Even though Ruby i