Chapter 21

A network is:
1. A list of activities
2. A sequence of activities
3. A rough plan of action
4. A way of identifying what doesn’t need doing
In Problem 1, the minimum number of dummy activities is:
1. 0
2. 1
3. 2
4. 3
In Problem 1, the total minimum duration is:
1. 6
2. 8
3. 14
4. 24
In Problem 1, the critical path is:
1. AC
2. AD
3. AEF
4. BEF
In Problem 1 the earliest starting time for D is:
1. 3
2. 4
3. 5
4. 6
In Problem 1, the total float for activity C is:
1. 1
2. 3
3. 5
4. 6
In Problem 1, which activity has the minimum slope?
1. C
2. D
3. E
4. F
In Problem 1, if you were to reduce the duration of only one activity it would be:
1. C
2. D
3. E
4. F
In Problem 1 the minimum duration for the project is:
1. 7
2. 9
3. 12
4. 14
In Problem 1, the extra cost of the minimum duration is:
1. 900
2. 1300
3. 1500
4. 1700