Suppose you have the following project digraph. (The numbers in ...

[Deast7027]

Suppose you have the following project digraph. (The numbers in parentheses represent hours.)

Scheduling this project with two processors results in a finishing time shorter than 22 hours using the priority list
◦ C, B, A, F, E, D.
◦ C, F, A, B, D, E.
◦ C, D, B, E, A, F.
◦ C, F, E, B, A, D.
◦ none of these

[kkenney]

none of these

[naturalchemist]

Suppose you have the following project digraph. (The numbers in parentheses represent hours.)

If we use the priority list F, E, A, D, B, G, C and the priority-list model to schedule this project with two processors, we should start by assigning
◦ task A to one processor, task B to the other one.
◦ task B to one processor, task E to the other one.
◦ task A to one processor, task C to the other one.
◦ task B to one processor, task C to the other one.
◦ none of these

[momo1250]

task A to one processor, task B to the other one.

[kodithompson]

Question 1

Suppose you have the following project digraph. (The numbers in parentheses represent hours.)

If we use the priority list F, E, A, D, B, G, C and the priority-list model to schedule this project with two processors, the project timeline is
◦

◦

◦

◦

◦ none of these

Question 2

Suppose you have the following project digraph. (The numbers in parentheses represent hours.)

Using the decreasing-time algorithm to schedule this project with two processors results in a completion time of
◦ 18 hours.
◦ 22 hours.
◦ 23 hours.
◦ 19 hours.
◦ none of these

[jharrington11]

Answer 1

Answer 2

22 hours.

[fox]

Question 1

Suppose you have the following project digraph. (The numbers in parentheses represent hours.)

Using the decreasing-time algorithm to schedule this project with two processors results in a finishing time of
◦ 24 hours.
◦ 22 hours.
◦ 21 hours.
◦ 26 hours.
◦ none of these

Question 2

Suppose you have the following project digraph. (The numbers in parentheses represent hours.)

If we use decreasing-time algorithm to schedule this project with two processors, we should start by assigning
◦ task B to one processor, task C to the other one.
◦ task B to one processor, task E to the other one.
◦ task A to one processor, task C to the other one.
◦ task A to one processor, task B to the other one.
◦ none of these

[wtf444]

Answer 1

26 hours.

Answer 2

task A to one processor, task C to the other one.

[Melani1276]

Question 1

Suppose you have the following project digraph. (The numbers in parentheses represent hours.)

Using the decreasing-time algorithm to schedule this project with two processors, the project finishing time is
◦ 18 hours.
◦ 17 hours.
◦ 20 hours.
◦ 19 hours.
◦ none of these

Question 2

Suppose you have the following project digraph. (The numbers in parentheses represent hours.)

Using the decreasing-time algorithm to schedule this project with two processors, the total combined idle time of the two processors is
◦ 1 hour.
◦ 7 hours.
◦ 5 hours.
◦ 3 hours.
◦ none of these

[Jane]

Answer 1

20 hours.

Answer 2

7 hours.