What is a precedence table?

What is an activity network?

How do you draw the vertices of an activity network?

What is an immediate predecessor?

How would we drawn an activity network?

How would you conduct the early time algorithm? (forward pass)

How would you conduct the late time algorithm? (reverse pass)

What is a critical activity?

What is a critical path?

If we are asked which activities to speed up, which ones should we primarily pick?

What is float time and how do we calculate it?

If a activity is delayed, how would we work the the minimum completion time?