Question 1

What is the chromatic number of a complete graph of 20 vertices?

Accepted Answer

A)  3 
B)  4 
C)  5 
D)  20 
A)  3 
B)  4 
C)  5 
D)  20

Question 2

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 9 lbs. $$4 \mathrm { lbs } , 5 \mathrm { lbs } , 3 \mathrm { lbs } , 2 \mathrm { lbs } , 7 \mathrm { lbs } , 6 \mathrm { lbs } , 4 \mathrm { lbs } , 2 \mathrm { lbs }$$

Accepted Answer

A)  
  
B)  
  
C)  
  
D)  Another packing 
A)  
  
B)  
  
C)  
  
D)  Another packing

Question 3

Use the order-requirement digraph below (with time given in minutes) and the priority list TS1U1B11S1U1B0, TS1U1B12S1U1B0, T S1U1B13S1U1B0, TS1U1B14S1U1B0, TS1U1B15S1U1B0, TS1U1B16S1U1B0 to answer Questions 13-16.  
-Apply the list-processing algorithm to construct a schedule using two processors.

Accepted Answer

The answer of Use the order-requirement digraph below (with time...

Question 4

When scheduling independent tasks, why does the decreasing-time-list algorithm generally produce good schedules? Does it always produce an optimal schedule?

Accepted Answer

It produces good schedules bec

Question 5

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. 5 lbs, 7 lbs, 1 lb, 2 lbs, 4 lbs, 5 lbs, 1 lb, 1 lb, 3 lbs, 6 lbs, 2 lbs, 3 lbs

Accepted Answer

A)  
  
B)  
  
C)  
  
D)  Another packing 
A)  
  
B)  
  
C)  
  
D)  Another packing

Question 6

Given the order-requirement digraph below (with time given in minutes), apply the critical-path scheduling algorithm to construct a schedule using two processors. How much time does the resulting schedule require?

Accepted Answer

A)  16 minutes 
B)  17 minutes 
C)  18 minutes 
D)  21 minutes 
A)  16 minutes 
B)  17 minutes 
C)  18 minutes 
D)  21 minutes

Question 7

Choose the packing 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. 5 lbs, 7 lbs, 1 lb, 2 lbs, 4 lbs, 5 lbs, 1 lb, 1 lb, 3 lbs, 6 lbs, 2 lbs

Accepted Answer

A) 
  
B) 
  
C) 
  
D) 
  
A) 
  
B) 
  
C) 
  
D)

Question 8

Choose the packing that results from the use of the worst-fit (WF) bin-packing algorithm to pack the following weights into bins that can hold no more than 9 lbs. $$4 \mathrm { lbs } , 5 \mathrm { lbs } , 3 \mathrm { lbs } , 2 \mathrm { lbs } , 7 \mathrm { lbs } , 6 \mathrm { lbs } , 4 \mathrm { lbs } , 2 \mathrm { lbs }$$

Accepted Answer

A)  
  
B)  
  
C)  
  
D)  Another packing 
A)  
  
B)  
  
C)  
  
D)  Another packing

Question 9

Given the order-requirement digraph below (with time given in minutes), apply the critical-path scheduling algorithm to construct a schedule using two processors. How much time does the resulting schedule require?

Accepted Answer

A)  21 minutes 
B)  22 minutes 
C)  23 minutes 
D)  24 minutes 
A)  21 minutes 
B)  22 minutes 
C)  23 minutes 
D)  24 minutes

Question 10

The table below shows chemical compounds that cannot be mixed without causing dangerous reactions. If a graph were used to facilitate scheduling of disposal containers for the compounds, how many edges would it have?

Accepted Answer

A) 7 
B)  8 
C)  16 
D)  20 
A) 7 
B)  8 
C)  16 
D)  20

Question 11

Assume a job consists of six independent tasks ranging in time from 3 to 12 minutes and totaling 36 minutes. Efficiently scheduled on four machines, how much time will the job require?

Accepted Answer

A)  Exactly 3 minutes 
B)  Exactly 9 minutes 
C)  Exactly 12 minutes 
D)  More than 12 minutes 
A)  Exactly 3 minutes 
B)  Exactly 9 minutes 
C)  Exactly 12 minutes 
D)  More than 12 minutes

Question 12

Choose the packing that results from the use of the first-fit decreasing (FFD) bin-packing algorithm to pack data files with the following sizes onto compact discs that can hold no more than 700 MB. 100 MB, 500 MB, 250 MB, 350 MB, 400 MB, 250 MB, 450 MB, 200 MB, 50 MB

Accepted Answer

A)    
B)    
C)    
D)    
A)    
B)    
C)    
D)

Question 13

Choose the packing that results from the use of the first-fit (FF) bin-packing algorithm to pack data files with the following sizes onto compact discs that can hold no more than 700 MB. 100 MB, 500 MB, 250 MB, 350 MB, 400 MB, 250 MB, 450 MB, 200 MB, 50 MB

Accepted Answer

A)    
B)    
C)    
D)    
A)    
B)    
C)    
D)

Question 14

A talent show producer needs to fit 17 acts of varying lengths into three segments. The segments should be as short as possible and are to be separated by intermissions. How many acts will be placed in each segment?

Accepted Answer

A)  Either five or six per segment 
B)  At least five per segment 
C)  No more than six per segment 
D)  The answer will vary, depending on the lengths of the acts 
A)  Either five or six per segment 
B)  At least five per segment 
C)  No more than six per segment 
D)  The answer will vary, depending on the lengths of the acts

Question 15

Find the chromatic number of the graph below:

Accepted Answer

The chroma

Question 16

Questions refer to this bin-packing task. Pack the following weights into bins holding no more than 5 lbs:
2 lbs, 1 lb, 4 lbs, 3 lbs, 4 lbs, 1 lb, 2 lbs, 3 lbs
-Find the number of bins required using the first-fit decreasing (FFD) algorithm.

Accepted Answer

A)  4 
B)  5 
C)  6 
D)  8 
A)  4 
B)  5 
C)  6 
D)  8

Question 17

Use the decreasing-time-list algorithm to schedule these tasks on two machines: How much time does the resulting schedule require? $$9 \text { minutes, } 8 \text { minutes, } 7 \text { minutes, } 9 \text { minutes, } 2 \text { minutes, } 5 \text { minutes. }$$

Accepted Answer

A)  19 minutes 
B)  20 minutes 
C)  21 minutes 
D)  22 minutes 
A)  19 minutes 
B)  20 minutes 
C)  21 minutes 
D)  22 minutes

Question 18

Choose the packing that results from the use of the first-fit (FF) bin-packing algorithm to pack the following weights into bins that can hold no more than 8 lbs. 5 lbs, 7 lbs, 1 lb, 2 lbs, 4 lbs, 5 lbs, 1 lb, 1 lb, 3 lbs, 6 lbs, 2 lbs

Accepted Answer

A) 
  
B) 
  
C) 
  
D) 
  
A) 
  
B) 
  
C) 
  
D)

Question 19

What is the chromatic number of the complete graph on six vertices?

Accepted Answer

The chroma

Question 20

Given the order-requirement digraph below (with time given in minutes) and the priority list T1, T2, T 3, T4, T5, T6, apply the list-processing algorithm to construct a schedule using two processors. How much time does the resulting schedule require?

Accepted Answer

A)  15 minutes 
B)  16 minutes 
C)  17 minutes 
D)  18 minutes 
A)  15 minutes 
B)  16 minutes 
C)  17 minutes 
D)  18 minutes

Exam 3: Planning and Scheduling

What is the chromatic number of a complete graph of 20 vertices?

Use the order-requirement digraph below (with time given in minutes) and the priority list T1, T2, T 3, T4, T5, T6 to answer Questions 13-16. -Apply the list-processing algorithm to construct a schedule using two processors.

When scheduling independent tasks, why does the decreasing-time-list algorithm generally produce good schedules? Does it always produce an optimal schedule?

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. 5 lbs, 7 lbs, 1 lb, 2 lbs, 4 lbs, 5 lbs, 1 lb, 1 lb, 3 lbs, 6 lbs, 2 lbs, 3 lbs

Given the order-requirement digraph below (with time given in minutes), apply the critical-path scheduling algorithm to construct a schedule using two processors. How much time does the resulting schedule require?

Choose the packing 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. 5 lbs, 7 lbs, 1 lb, 2 lbs, 4 lbs, 5 lbs, 1 lb, 1 lb, 3 lbs, 6 lbs, 2 lbs

Given the order-requirement digraph below (with time given in minutes), apply the critical-path scheduling algorithm to construct a schedule using two processors. How much time does the resulting schedule require?

The table below shows chemical compounds that cannot be mixed without causing dangerous reactions. If a graph were used to facilitate scheduling of disposal containers for the compounds, how many edges would it have?

Assume a job consists of six independent tasks ranging in time from 3 to 12 minutes and totaling 36 minutes. Efficiently scheduled on four machines, how much time will the job require?

Choose the packing that results from the use of the first-fit decreasing (FFD) bin-packing algorithm to pack data files with the following sizes onto compact discs that can hold no more than 700 MB. 100 MB, 500 MB, 250 MB, 350 MB, 400 MB, 250 MB, 450 MB, 200 MB, 50 MB

Choose the packing that results from the use of the first-fit (FF) bin-packing algorithm to pack data files with the following sizes onto compact discs that can hold no more than 700 MB. 100 MB, 500 MB, 250 MB, 350 MB, 400 MB, 250 MB, 450 MB, 200 MB, 50 MB

A talent show producer needs to fit 17 acts of varying lengths into three segments. The segments should be as short as possible and are to be separated by intermissions. How many acts will be placed in each segment?

Find the chromatic number of the graph below:

Questions refer to this bin-packing task. Pack the following weights into bins holding no more than 5 lbs: 2 lbs, 1 lb, 4 lbs, 3 lbs, 4 lbs, 1 lb, 2 lbs, 3 lbs -Find the number of bins required using the first-fit decreasing (FFD) algorithm.

Choose the packing that results from the use of the first-fit (FF) bin-packing algorithm to pack the following weights into bins that can hold no more than 8 lbs. 5 lbs, 7 lbs, 1 lb, 2 lbs, 4 lbs, 5 lbs, 1 lb, 1 lb, 3 lbs, 6 lbs, 2 lbs

What is the chromatic number of the complete graph on six vertices?

Given the order-requirement digraph below (with time given in minutes) and the priority list T1, T2, T 3, T4, T5, T6, apply the list-processing algorithm to construct a schedule using two processors. How much time does the resulting schedule require?

Urban Services

Business Efficiency

Linear Programming

Exploring Data: Distributions

Exploring Data: Relationships

Data for Decisions

Probability: the Mathematics of Chance

Social Choice: the Impossible Dream

The Manipulability of Voting Systems

Weighted Voting Systems

Electing the President

Fair Division

Apportionment

Game Theory: the Mathematics of Competition

Identification Numbers

Information Science

Growth and Form

Symmetry and Patterns

Tilings

Savings Models

Borrowing Models

The Economics of Resources

Filters

Use the order-requirement digraph below (with time given in minutes) and the priority list T₁, T₂, T ₃, T₄, T₅, T₆ to answer Questions 13-16. -Apply the list-processing algorithm to construct a schedule using two processors.

Given the order-requirement digraph below (with time given in minutes) and the priority list T₁, T₂, T ₃, T₄, T₅, T₆, apply the list-processing algorithm to construct a schedule using two processors. How much time does the resulting schedule require?