What is the name given to the table which defines which activities must come before which?
- Payoff table
- Contingency table
- Statistical table
- Precedence table
Which of the following statements is not true?
- A dummy activity represents a real activity
- A dummy activity takes zero time
- There are two types of dummy activities: logical dummies and uniqueness dummies
- Sometimes dummy activities are required to ensure the network makes sense
If two activities have the same preceding activities and themselves precede the same other activities, what must be introduced into the network?
- A logical dummy activity
- A uniqueness dummy activity
- A float
- A Gantt chart
The earliest possible time at which a node can occur is called the:
- Crash Time
- Float
- Earliest event time
- Latest event time
The latest possible time at which a node can occur is called the:
- Latest event Ttme
- Duration
- Critical time
- Float
Which of the following is not used when calculating the float of an activity:
- Earliest event time of preceding node
- Latest event time of following node
- Earliest event time of the following node
- Duration of the activity
Which of the following statements is not true?
- All activities on the critical path have a zero float
- The critical path is the longest route through the network
- There may be more than one critical path
- The critical path is the shortest route through the network
Which of the following characteristics is not possessed by a Gantt chart?
- It identifies the critical activities
- It allows us to see the interdependence of one activity upon another
- It enables us to see how many resources are required at any one time
- It can be used to adjust the timing of non-critical activities to spread the workload more evenly
What is the name given to the process of reducing the duration of an activity by adding resources and hence usually increasing costs?
- Cutting
- Smashing
- Crashing
- Breaking
Which of the following is true?
- A network must have a single start node and a single final node
- A network may have numerous start nodes
- A network may have numerous final nodes
- A network need not have a start node or a final node