12S D2 Scheduling 0300- Test Review
Name: ______________ Period: _______
Use the above order-requirement digraph to…
1. Identify the critical path. What is its weight?
Answer: ________
2. Use the list-processing algorithm to schedule these tasks using
the following priority list: T1, T7, T2, T6, T3, T5, T4on one
processor.
Page 1 of 7
12S D2 Scheduling 0300- Test Review
3. Use the priority list in number 2 to schedule the tasks using two
processors.
4. What’s the optimal completion time for these tasks scheduled on
three processors?
Answer_______
5. Apply the critical-path scheduling algorithm to construct a
priority list and schedule using two machines.
Page 2 of 7
12S D2 Scheduling 0300- Test Review
Use the order-requirement digraph below to…
6. Identify the critical path. What is its weight?
Answer: ________
7. Use the list-processing algorithm to schedule these tasks using
the following priority list: T1, T7, T2, T6, T3, T5, T4, T8on one
processor.
Page 3 of 7
12S D2 Scheduling 0300- Test Review
8. Use the priority list in number 7 to schedule the tasks using two
processors.
9. What’s the minimum completion time for these tasks scheduled
on three processors?
Answer_______
10. Apply the critical-path scheduling algorithm to construct a
priority list and schedule using two machines.
Page 4 of 7
12S D2 Scheduling 0300- Test Review
11. Use the decreasing-time list algorithm to schedule these
independent tasks on two machines: 4, 5, 8, 3, 3, 7. How much
time does the resulting schedule require?
Answer: ______
12. Use the decreasing-time list algorithm to schedule these
independent tasks on two machines: 9, 8, 7, 9, 2, 5. How much
time does the resulting schedule require?
Answer: ______
Page 5 of 7
12S D2 Scheduling 0300- Test Review
Pack the following weights in bins that can hold no more than 9 to
answer #s 13-19:
5, 7, 1, 2, 4, 5, 1, 1, 3, 6, 2
13. Using the next-fit (NF) bin-packing algorithm.
14. Using the first-fit (FF) bin-packing algorithm.
15. Using the worst-fit (WF) bin-packing algorithm.
16. Using the first-fit decreasing (FFD) bin-packing algorithm.
17. Using the next-fit decreasing (NFD) bin-packing algorithm.
18. Using the worst-fit decreasing (WFD) bin-packing algorithm.
Page 6 of 7
12S D2 Scheduling 0300- Test Review
19. Which of the following algorithms: first-fit (FF), next-fit (NF),
or worst-fit (WF) would be most preferable when filling boxes
on an assembly line?
Answer: ___________
20. Which of the following algorithms: first-fit (FF), next-fit (NF),
or worst-fit (WF) would be most preferable when cutting fabric.
Answer: ___________
21. Which of the following algorithms: first-fit (FF), next-fit (NF),
or worst-fit (WF) would be most preferable when putting away
dishes on a shelf.
Answer: __________
True or false:
22. The first fit (FF) algorithm never uses more boxes than the
next fit (NF) algorithm.
Answer: _____
23. When scheduling tasks using the list-processing algorithm,
increasing the number of machines always reduces the
completion time.
Answer: _____
24. The first-fit (FF) algorithm for bin packing is guaranteed to
always produce an optimal solution.
Answer: _____
25. The critical path algorithm for scheduling tasks is guaranteed
to always produce an optimal schedule.
Answer: _____
Page 7 of 7