Topics Ch 3 Test A. A) 14 minutes B) 15 minutes C) 16 minutes minutes

Size: px

Start display at page:

Download "Topics Ch 3 Test A. A) 14 minutes B) 15 minutes C) 16 minutes minutes"

Hugo Bond
6 years ago
Views:

1 Topics Ch 3 Test A Name: Period:. Given the order-requirement digraph below (with time given in minutes) and the priority list TI, T2, T 3, T4, Ts, T6, apply the list-processing algorithm to construct a schedule using two processors. How much time does the resulting schedule require? A) 14 minutes B) 15 minutes C) 16 minutes minutes. Given the order-requirement digraph below (with time given in minutes) and the priority list T1, T2, T 3, T4, Ts, T6, apply the critical-path scheduling algorithm to construct a schedule using two processors. How much time does the resulting schedule require? A) 14 minutes B) 15 minutes 16 minutes 18 minutes 3. hat is the minimum time required to complete eight independent tasks on two processors when the sum of all the times of the eight tasks is 72 minutes? A) 4 minutes B) 9 minutes C) 16 minutes 6 minutes Page 1

2 4. Use the decreasing-time-list algorithm to schedule these tasks on two machines: 3 minutes, 5 minutes, 8 minutes, 4 minutes, 6 minutes, 2 minutes How much time does the resulting schedule require? <:ZÿZ514 minutes B) 15 minutes C) 16 minutes D) 18 minutes Choose the packing that results from the use of the ftrst fit (FF) bin-packing algorithm to pack the following weights into bins that can hold no more than 8 lbs. 6 lbs, 2 lbs, 4 lbs, 3 lbs, 5 lbs, 3 lbs, 2 lbs, 4 lbs Choose the paÿking that results from the use of the next fit (NF) bin-packing algorithm to pack the following weights into bins that can hold no more than 8 lbs. 6 lbs, 2 lbs, 4 lbs, 3 lbs, 5 lbs, 3 lbs, 2 lbs, 4 lbs Page 2

3 . Choose the packing that results from the use of the worst fit (F) bin-packing algorithm to pack the following weights into bins that can hold no more than 8 lbs. 6 lbs, 2 lbs, 4 lbs, 3 lbs, 5 lbs, 3 lbs, 2 lbs, 4 lbs Cÿ Choose the packing that results from the use of the first-fit decreasing (FFD) bin-packing algorithm to pack the following weights into bins that can hold no more than 8 lbs. 6 lbs, 2 lbs, 4 lbs, 3 lbs, 5 lbs, 3 lbs, 2 lbs, 4 lbs Page 3

4 9ÿ Choose the packing that results from the use of the next-fit decreasing (NFD) bin-packing algorithm to pack the following weights into bins that can hold no more than 8 lbs. 6 lbs, 2 lbs, 4 l bs, 3 lbs, 5 lbs, 3 lbs, 2 lbs, 4 lbs 10. Choose the packing that results fÿom the use of the worst-fit decreasing (FD) bin-packing algorithm to pack the following weights into bins that can hold no more than 8 lbs. 6 lbs, 2 lbs, 4 l bs, 3 lbs, 5 lbs, 3 lbs, 2 lbs, 4 lbs Cu ) ) Page 4

5 11. hich of the following is a con'ect vertex coloring of the given graph? (Capital letters indicate which color the vertex is colored.) I, P O II, B Y A) I only Y B b Both I and II D I Neither only I nor II 13. Find the chromatic number of the graph below: "3 D) Use the decreasing-time-list algorithm to schedule these tasks on two machines: 9 minutes, 6 minutes, 3 minutes, 4 minutes, 8 minutes How much time does the resulting schedule require? A) 14 minutes.ÿ) 1516 minutes minutes 17 minutes Page 5

6 15. The first fit (FF) algorithm never uses more boxes than the next fit (NF) algorithm. A) True (ÿ)false 16. The worst fit (F) algorithm never uses more boxes than the first fit (FF) algorithm. A) True (ÿ) False 17. hen scheduling tasks using the list-processing algorithm, increasing the number of machines always reduces the completion time. A) True (ÿ)ÿalse 18. The list-processing algoi:ithm for scheduling tasks is guaranteed to always produce an optimal solution. FTrue alse 19. hich of the following is a correct vertex coloring of the given graph? (Capital letters indicate which color the vertex is colored.) I, / II only C) Both I and II D) Neither I nor II Z, w / y 7... J Page 6

7 20. Find the ctn'omatic number of the graph below: A) 6 B) Given the order-requirement digraph below (with time given in minutes) and the priority list T1, T2, T 3, T4, T5, T6, T7, apply the list-processing algorittam to construct a schedule using two processors. How much time does the resulting schedule require? Tt ÿ T4,.--.., Tÿ 16 minutes 17 minutes C) 18 minutes D) 21 minutes Page 7

8 22. Given the order-requirement digraphbelow (with time given in minutes) and thepl2iority list TI, T2, T 3, T4, Ts, T6, T7, Ts,, apply the critical-path scheduling algorithm to construct a schedule using two processors. How much time does the resulting schedule require? is rs "rs / \ A) 40 minutes Cÿ 445 minutes D) 49 minutes 23. hich of the following is a correct vertex coloring of the given graph? (Capital letters indicate which color the vertex is colored.) II[ÿ w G A) [.only ) II only C) Both I and II D) Neither I nor II Y Y G 24. hat is the minimum time required to complete eight independent tasks with a total task time of 160 minutes on four machines? A) I0 minutes B) 20 minutes Dÿ40 60 minutes Pag9 8

Introduction to Algorithms

Introduction to Algorithms 6.46J/.4J LECTURE 7 Shortest Paths I Properties o shortest paths Dijkstra s Correctness Analysis Breadth-irst Paths in graphs Consider a digraph G = (V, E) with edge-weight unction