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
State the ways to construct container taxonomy There are several ways that we could construct our container taxonomy from here; one way that works well is to make a fundamental

Q. Write  down the  algorithm  to  insert  an  element  to  a  max-heap  which  is  represented sequentially.           Ans: The algorithm to insert an element "newkey" to

Memory Allocation Strategies If it is not desirable to move blocks of due storage from one area of memory to another, it must be possible to relocate memory blocks that have be

Q. The degree of a node is defined as the number of children it has. Shear show that in any binary tree, the total number of leaves is one more than the number of nodes of degree 2

The searching method are applicable to a number of places in current's world, may it be Internet, search engines, text pattern matching, on line enquiry, finding a record from data

There are ten stations on a railway line: Train travels in both directions (i.e. from 1 to 10 and then from 10 to 1).  Fare between each station is $2. A passenger input

Q. Using the following given inorder and preorder traversal reconstruct a binary tree Inorder sequence is D, G, B, H, E, A, F, I, C

Q. Explain the term hashing? Explain any five well known hash functions.                         Ans: Hashing method provides us the direct access of record from the f

The insertion procedure in a red-black tree is similar to a binary search tree i.e., the insertion proceeds in a similar manner but after insertion of nodes x into the tree T, we c

Q. Execute your algorithm to convert the infix expression to the post fix expression with the given infix expression as input Q = [(A + B)/(C + D) ↑ (E / F)]+ (G + H)/ I