TOM 3010 notes MOD 4 questions with verified solutions
1. When creating an AON graph, you always draw
nodes all for which of its predecessor
activities have been completed.
2. The earliest completion time is the earliest start
time plus the activity time.
path
3. A is a sequence of nodes and arrows
within the activity network.
process
4. The completion time of individual activities is
most important in management.
5. The path is the path with the longest duration. critical
6. Click and drag on elements in order
Arrange the steps to compute the earliest
completion time (ECT) of the project.
7. Loops in an activity network indicate events.
interdependent
8. The earliest start time of the first activity is time . zero or 0
9. The duration of a path is calculated by up the adding,
summing, or to-
activity times of the activities that constitute that path. talling
10. time is the amount of time an activity can Slack
be de- layed without affecting the overall
completion time of the project.
11. Match the type of management with the
1. Bottleneck
activity that needs to be identified.
activity
1/
32
, TOM 3010 notes MOD 4 questions with verified solutions
2. Last activity completed
2/
32
, TOM 3010 notes MOD 4 questions with verified solutions
1. Process management
2. Project management
12. Select all that apply A2
A project consists of three tasks: A1,A2, and A3. A1
A1 must be completed before A3. Which activities
can start at time 0?
13. A project consists of three tasks: A1,A2, and
A3. A1
A1 must be completed before A3. There is an
arrow point- ing away from which node?
14. The slack time of an activity is based on the early start late
schedule and the start schedule.
15. The earliest start time for an activity is the earliest time predecessor
or preceding
all activities have been completed.
16. When computing the late start schedule, the latest
latest start time for an activity should be set
to the
completion time of the activity minus its
activity time.
17. Activities on the critical path have slack time. zero
18. The time of an activity can be calculated as activity.
Latest start time - Earliest start time.
20. When
19. The latest completion time of an activity is computing
based on the latest start times of of that the late
3/
32
, TOM 3010 notes MOD 4 questions with verified solutions
start schedule, the latest completion time for slack
an activity should be set to the latest start
time of all activities.
successors
dependent
4/
32
1. When creating an AON graph, you always draw
nodes all for which of its predecessor
activities have been completed.
2. The earliest completion time is the earliest start
time plus the activity time.
path
3. A is a sequence of nodes and arrows
within the activity network.
process
4. The completion time of individual activities is
most important in management.
5. The path is the path with the longest duration. critical
6. Click and drag on elements in order
Arrange the steps to compute the earliest
completion time (ECT) of the project.
7. Loops in an activity network indicate events.
interdependent
8. The earliest start time of the first activity is time . zero or 0
9. The duration of a path is calculated by up the adding,
summing, or to-
activity times of the activities that constitute that path. talling
10. time is the amount of time an activity can Slack
be de- layed without affecting the overall
completion time of the project.
11. Match the type of management with the
1. Bottleneck
activity that needs to be identified.
activity
1/
32
, TOM 3010 notes MOD 4 questions with verified solutions
2. Last activity completed
2/
32
, TOM 3010 notes MOD 4 questions with verified solutions
1. Process management
2. Project management
12. Select all that apply A2
A project consists of three tasks: A1,A2, and A3. A1
A1 must be completed before A3. Which activities
can start at time 0?
13. A project consists of three tasks: A1,A2, and
A3. A1
A1 must be completed before A3. There is an
arrow point- ing away from which node?
14. The slack time of an activity is based on the early start late
schedule and the start schedule.
15. The earliest start time for an activity is the earliest time predecessor
or preceding
all activities have been completed.
16. When computing the late start schedule, the latest
latest start time for an activity should be set
to the
completion time of the activity minus its
activity time.
17. Activities on the critical path have slack time. zero
18. The time of an activity can be calculated as activity.
Latest start time - Earliest start time.
20. When
19. The latest completion time of an activity is computing
based on the latest start times of of that the late
3/
32
, TOM 3010 notes MOD 4 questions with verified solutions
start schedule, the latest completion time for slack
an activity should be set to the latest start
time of all activities.
successors
dependent
4/
32
