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
Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file 2-add each car which is repr

Question 1 Explain the use of algorithms in computing Question 2 Explain time complexity and space complexity of an algorithm Question 3 Explain how you can analyz

A shop sells books, maps and magazines. Every item is identified by a unique 4 - digit code. All books have a code starting with a 1, all maps have a code which starts with a 2 and

Representation of data structure in memory is known as: Abstract data type

Adjacency list representation An Adjacency list representation of Graph G = {V, E} contains an array of adjacency lists mentioned by adj of V list. For each of the vertex u?V,


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

In computer programming, Trees are utilized enormously. These can be utilized for developing database search times (binary search trees, AVL trees, 2-3 trees, red-black trees), Gam

5. Implement a stack (write pseudo-code for STACK-EMPTY, PUSH, and POP) using a singly linked list L. The operations PUSH and POP should still take O(1) time.

infix to revrse polish