Question 1

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? A) 14 minutes B) 15 minutes C) 16 minutes D) 18 minutes

Accepted Answer

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

Question 2

Find the chromatic number of the graph below:

Accepted Answer

The answer of Find the chromatic number of the graph...

Question 3

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? A) 14 minutes B) 15 minutes C) 16 minutes D) 18 minutes

Accepted Answer

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

Question 4

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

Accepted Answer

The answer of What is the chromatic number of the...

Question 5

What is the minimum time to complete 12 independent tasks on four processors when the sum of all the times of the 12 tasks is 60 minutes?

Accepted Answer

The answer of What is the minimum time to complete...

Question 6

-Use the next-fit (NF) bin-packing algorithm to pack the following weights into bins that can hold no more than 10 lbs. 
 1 lb, 2 lbs, 2 lbs, 7 lbs, 8 lbs, 5 lbs, 8 lbs, 4 lbs, 10 lbs, 6 lbs

Accepted Answer

The answer of 
-Use the next-fit (NF) bin-packing algorithm to...

Question 7

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

Accepted Answer

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

Question 8

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? A) 15 minutes B) 16 minutes C) 17 minutes D) 18 minutes

Accepted Answer

To apply the list-processing algorithm, we select the task with the highest priority (which is T₁) and assign it to one of the processors. Then, we select the next task with the highest priority (which is T₂) and assign it to the other processor. Now we need to determine which task to assign next. To do this, we look at the remaining tasks and their dependencies. The only task that can be assigned next is T₃, as it has no dependencies and has the highest priority. T₁: Processor 1 (0-3 minutes) T₂: Processor 2 (0-4 minutes) T₃: Processor 1 (3-6 minutes) T₄: Processor 2 (4-7 minutes) T₆: Processor 1 (7-10 minutes) T₅: Processor 2 (7-11 minutes) The resulting schedule requires a total of 17 minutes, which is the completion time of the last task. Therefore, the answer is C.

Question 9

Find the chromatic number of the graph below:

Accepted Answer

The answer of Find the chromatic number of the graph...

Question 10

Use the order requirement digraph below (with time given in minutes) and the priority list TS1U1B11S1U1B0, TS1U1B12S1U1B0, TS1U1B13S1U1B0, TS1U1B14S1U1B0, TS1U1B15S1U1B0, TS1U1B16S1U1B0, TS1U1B17S1U1B0, TS1U1B18S1U1B0 to answer the following Questions 
-Apply the critical-path scheduling algorithm to construct a schedule using three processors.

Accepted Answer

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

Question 11

Find the chromatic number of the graph below:

Accepted Answer

The answer of Find the chromatic number of the graph...

Question 12

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? A) 21 minutes B) 22 minutes C) 23 minutes D) 24 minutes

Accepted Answer

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

Question 13

Use the decreasing-time-list algorithm to schedule these tasks on three machines:
7, 2, 5, 3, 9, 1, 6, 5, 3, 7 (time in minutes).
How much time does the resulting schedule require?

Accepted Answer

The answer of Use the decreasing-time-list algorithm to schedule these...

Question 14

Use the order requirement digraph below (with time given in minutes) and the priority list TS1U1B11S1U1B0, TS1U1B12S1U1B0, TS1U1B13S1U1B0, TS1U1B14S1U1B0, TS1U1B15S1U1B0, TS1U1B16S1U1B0, TS1U1B17S1U1B0, TS1U1B18S1U1B0 to answer the following Questions 
-Apply the list-processing algorithm to construct a schedule using three processors.

Accepted Answer

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

Question 15

Given the order-requirement digraph below (with time given in minutes) and the priority list T₁, T₂, 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? A) 40 minutes B) 44 minutes C) 45 minutes D) 49 minutes

Accepted Answer

Using the list-processing algorithm, we first consider the tasks with the highest priority: 1. T₁ and T₂ are both of the same priority and can be scheduled simultaneously on two processors. They both have no predecessors, so they can start at time 0. They both take 4 minutes to complete, so they will finish at time 4. 2. The next highest priority is T₃, which has both T₁ and T₂ as predecessors. However, they will both be finished at time 4, so T₃ can start then. It takes 3 minutes to complete, so it will finish at time 7. 3. The next highest priority is T₄, which has T₃ as a predecessor. It can start at time 7 and takes 2 minutes to complete, so it will finish at time 9. 4. The next highest priority is T₅, which has T₃ as a predecessor. However, T₄ is still running until time 9, so T₅ cannot start until then. It takes 5 minutes to complete, so it will finish at time 14. 5. The next highest priority is T₆, which has both T₄ and T₅ as predecessors. Both tasks will be finished at time 14, so T₆ can start then. It takes 2 minutes to complete, so it will finish at time 16. 6. The next highest priority is T₇, which has T₆ as a predecessor. It can start at time 16 and takes 4 minutes to complete, so it will finish at time 20. 7. The next highest priority is T₈, which has T₆ as a predecessor. However, T₇ is still running until time 20, so T₈ cannot start until then. It takes 5 minutes to complete, so it will finish at time 25. Therefore, the resulting schedule requires a total of 25 minutes.

Question 16

Compare the first-fit (FF) and first-fit decreasing (FFD) bin-packing algorithms in packing the following weights into bins that can hold no more than 10 lbs. 
3 lb, 8 lbs, 5 lbs, 7 lbs, 5 lbs, 5 lbs, 8 lbs, 4 lbs, 10 lbs, 6 lbs

Accepted Answer

The answer of Compare the first-fit (FF) and first-fit decreasing...

Question 17

Use the decreasing-time-list algorithm to schedule these tasks on two machines:
4, 2, 1, 6, 4, 5, 4 (time in minutes).
How much time does the resulting schedule require?

Accepted Answer

The answer of Use the decreasing-time-list algorithm to schedule these...

Question 18

Use the order requirement digraph below (with time given in minutes) and the priority list TS1U1B11S1U1B0, TS1U1B12S1U1B0, TS1U1B13S1U1B0, TS1U1B14S1U1B0, TS1U1B15S1U1B0, TS1U1B16S1U1B0, TS1U1B17S1U1B0, TS1U1B18S1U1B0 to answer the following Questions 
-Apply the critical-path scheduling algorithm to construct a schedule using two processors.

Accepted Answer

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

Question 19

Find the chromatic number of the graph below:

Accepted Answer

The answer of Find the chromatic number of the graph...

Question 20

Given the order-requirement digraph below (with time given in minutes) and the priority list T₁, 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? A) 16 minutes B) 17 minutes C) 18 minutes D) 21 minutes

Accepted Answer

The list-processing algorithm works as follows: 1. Start with an empty schedule and an empty list of tasks. 2. Find the highest-priority task that has all of its prerequisites completed and add it to the list of tasks to be scheduled. 3. If there are two or more tasks with the same priority and all of their prerequisites completed, choose one of them arbitrarily. 4. Repeat steps 2 and 3 until all tasks are scheduled. Using this algorithm and the given priority list, we can construct the following schedule for two processors: Processor 1: T₁ T₃ T₅ T₇ Processor 2: T₂ T₄ T₆ The resulting schedule requires a total of 17 minutes. Therefore, the answer is B.

Quiz 3: Planning and Scheduling

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?

Find the chromatic number of the graph below:

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?

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

What is the minimum time to complete 12 independent tasks on four processors when the sum of all the times of the 12 tasks is 60 minutes?

-Use the next-fit (NF) bin-packing algorithm to pack the following weights into bins that can hold no more than 10 lbs. 1 lb, 2 lbs, 2 lbs, 7 lbs, 8 lbs, 5 lbs, 8 lbs, 4 lbs, 10 lbs, 6 lbs

Use the order requirement digraph below (with time given in minutes) and the priority list T₁, T₂, T₃, T₄, T₅, T₆, T₇, T₈ to answer the following Questions -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?

Find the chromatic number of the graph below:

Use the order requirement digraph below (with time given in minutes) and the priority list T₁, T₂, T₃, T₄, T₅, T₆, T₇, T₈ to answer the following Questions -Apply the critical-path scheduling algorithm to construct a schedule using three processors.

Find the chromatic number of the graph below:

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?

Use the decreasing-time-list algorithm to schedule these tasks on three machines: 7, 2, 5, 3, 9, 1, 6, 5, 3, 7 (time in minutes). How much time does the resulting schedule require?

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

Given the order-requirement digraph below (with time given in minutes) and the priority list T₁, T₂, 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?

Compare the first-fit (FF) and first-fit decreasing (FFD) bin-packing algorithms in packing the following weights into bins that can hold no more than 10 lbs. 3 lb, 8 lbs, 5 lbs, 7 lbs, 5 lbs, 5 lbs, 8 lbs, 4 lbs, 10 lbs, 6 lbs

Use the decreasing-time-list algorithm to schedule these tasks on two machines: 4, 2, 1, 6, 4, 5, 4 (time in minutes). How much time does the resulting schedule require?

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

Find the chromatic number of the graph below:

Given the order-requirement digraph below (with time given in minutes) and the priority list T₁, 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?

Quiz 3: Planning and Scheduling

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

Find the chromatic number of the graph below:

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?

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

What is the minimum time to complete 12 independent tasks on four processors when the sum of all the times of the 12 tasks is 60 minutes?

-Use the next-fit (NF) bin-packing algorithm to pack the following weights into bins that can hold no more than 10 lbs. 1 lb, 2 lbs, 2 lbs, 7 lbs, 8 lbs, 5 lbs, 8 lbs, 4 lbs, 10 lbs, 6 lbs

Use the order requirement digraph below (with time given in minutes) and the priority list T1, T2, T3, T4, T5, T6, T7, T8 to answer the following Questions -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 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?

Find the chromatic number of the graph below:

Use the order requirement digraph below (with time given in minutes) and the priority list T1, T2, T3, T4, T5, T6, T7, T8 to answer the following Questions -Apply the critical-path scheduling algorithm to construct a schedule using three processors.

Find the chromatic number of the graph below:

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?

Use the decreasing-time-list algorithm to schedule these tasks on three machines: 7, 2, 5, 3, 9, 1, 6, 5, 3, 7 (time in minutes). How much time does the resulting schedule require?

Use the order requirement digraph below (with time given in minutes) and the priority list T1, T2, T3, T4, T5, T6, T7, T8 to answer the following Questions -Apply the list-processing algorithm to construct a schedule using three processors.

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

Compare the first-fit (FF) and first-fit decreasing (FFD) bin-packing algorithms in packing the following weights into bins that can hold no more than 10 lbs. 3 lb, 8 lbs, 5 lbs, 7 lbs, 5 lbs, 5 lbs, 8 lbs, 4 lbs, 10 lbs, 6 lbs

Use the decreasing-time-list algorithm to schedule these tasks on two machines: 4, 2, 1, 6, 4, 5, 4 (time in minutes). How much time does the resulting schedule require?

Use the order requirement digraph below (with time given in minutes) and the priority list T1, T2, T3, T4, T5, T6, T7, T8 to answer the following Questions -Apply the critical-path scheduling algorithm to construct a schedule using two processors.

Find the chromatic number of the graph below:

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 algorithm to construct a schedule using two processors. How much time does the resulting schedule require?

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?

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?

Use the order requirement digraph below (with time given in minutes) and the priority list T₁, T₂, T₃, T₄, T₅, T₆, T₇, T₈ to answer the following Questions -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?

Use the order requirement digraph below (with time given in minutes) and the priority list T₁, T₂, T₃, T₄, T₅, T₆, T₇, T₈ to answer the following Questions -Apply the critical-path scheduling algorithm to construct a schedule using three 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?

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

Given the order-requirement digraph below (with time given in minutes) and the priority list T₁, T₂, 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?

Use the order requirement digraph below (with time given in minutes) and the priority list T₁, T₂, T₃, T₄, T₅, T₆, T₇, T₈ to answer the following Questions -Apply the critical-path scheduling 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₆, T₇, apply the list-processing algorithm to construct a schedule using two processors. How much time does the resulting schedule require?