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
Ask question find frequency count of function- {for(i=1;i {for(j=1;j {for(k=1;k } } }

Program: Creation of a Circular linked list ALGORITHM (Insertion of an element into a Circular Linked List) Step 1        Begin Step 2      if the list is empty or new

How do collisions happen during hashing? Usually the key space is much larger than the address space, thus, many keys are mapped to the same address. Assume that two keys K1 an

i need the full concept of it... please can anyone provide

Determine the effect of Ruby in implementation of string Ruby has a String class whose instances are mutable sequences of Unicode characters. Symbol class instances are charact

In this sorting algorithm, multiple swapping occurs in one pass. Smaller elements move or 'bubble' up to the top of the list, so the name given to the algorithm. In this method,

Write an algorithm, using a flowchart, which inputs the heights of all 500 students and outputs the height of the tallest person and the shortest p erson in the school.

Consistent Heuristic Function - Graph Search Recall the notions of consistency and admissibility for an A* search heuristic. a. Consider a graph with four nodes S, A, B, C,

Dequeue (a double ended queue) is an abstract data type alike to queue, where insertion and deletion of elements are allowed at both of the ends. Like a linear queue & a circular q