Explain critical path and chain, Data Structure & Algorithms

1.  Using the traditional method of CPM:

a.  What activities are on the critical path?

b.  What is the expected total lead time of the project?

2.  Using CCPM:

a.  What is the duration time for activities B, D and G?

b.  What activities are on the critical chain?

c.   Where should the Feeding Buffer(s) be positioned?

d.  How large is the Project Buffer?

e.  What is the expected total lead time for the project?


Posted Date: 3/12/2013 7:25:48 AM | Location : United States

Related Discussions:- Explain critical path and chain, Assignment Help, Ask Question on Explain critical path and chain, Get Answer, Expert's Help, Explain critical path and chain Discussions

Write discussion on Explain critical path and chain
Your posts are moderated
Related Questions

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

a. Determine the result of inserting the keys 4,19, 17, 11, 3, 12, 8, 20, 22, 23, 13, 18, 14, 16, 1, 2, 24, 25, 26, 5 in order to an empty B-Tree of degree 3. Only draw the configu

What is the best case complexity of quick sort In the best case complexity, the pivot is in the middle.

(a) Suppose that t is a binary tree of integers (that is, an object of type BinTree of Int.) in the state shown in Figure 3.   Give the vectors returned by each of the f

Binary search technique:-  This technique is applied to an ordered list where elements are arranged either in ascending order or descending order. The array is separated into t

One of the main problems with the linear queue is the lack of appropriate utilization of space. Assume that the queue can store 100 elements & the complete queue is full. Thus, it

Question: (a) Discuss the importance of game theory to decisions. (b) Explain the following: (i) saddle point, (ii) two-person zero-sum game. (c) Two leading ?rms, ABC Ltd a

Merge sort is a sorting algorithm which uses the basic idea of divide and conquers. This algorithm initially divides the array into two halves, sorts them separately and then merge

A full binary tree with 2n+1 nodes have n non-leaf nodes