CHP 8: Critical Path Analysis - Key Terminology Flashcards

1
Q

Definition of PRECEDENCE/DEPENDENCE TABLE

A

A table which shows which activities must be completed before others are started.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Definition of ACTIVITY NETWORK

A

The activities are represented by arcs and the completion of those activities, known as events, are shown as nodes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

State the features of an ACTIVITY NETWORK

A
  • Each arc is labelled with a letter.
  • The beginning and end of that activity is shown by the ends of the arc.
  • Arrow are used to define direction.
  • Convention is to use straight lines for arcs.
  • Each node is numbered from 0 to N.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Definition of SOURCE NODE

A

Nodes are numbered from 0 which is the first node named the source node.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Definition of SINK NODE

A

The final node added.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Definition of DUMMY ACTIVITY

A

It has no time or cost. Its sole purpose is to show dependencies between activities.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Why are DUMMIES used?

A

1) As every activity must be uniquely represented in terms of its events, this requires that there can be at most one activity between any two events.
2) To show the dependence of an activity.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly