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

[cherise1989]

Question 1

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

Using the critical-path algorithm to schedule this project with three processors results in a finishing time of
◦ 23 hours.
◦ 19 hours.
◦ 18 hours.
◦ 22 hours.
◦ none of these

Question 2

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

Using the critical-path algorithm to schedule this project with six processors results in a finishing time of
◦ 23 hours.
◦ 18 hours.
◦ 22 hours.
◦ 19 hours.
◦ none of these

[triiciiaa]

Answer 1

18 hours.

Answer 2

18 hours.

[beccaep]

Question 1

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

The length of the critical path from E is
◦ 9 hours.
◦ 2 hours.
◦ 6 hours.
◦ 8 hours.
◦ none of these

Question 2

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

The length of the critical path from B is
◦ 13 hours.
◦ 18 hours.
◦ 5 hours.
◦ 21 hours.
◦ none of these

[perkiness]

Answer 1

8 hours.

Answer 2

18 hours.

[nramada]

Question 1

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

The length of the critical path for the entire project is
◦ 17 hours.
◦ 26 hours.
◦ 21 hours.
◦ 18 hours.
◦ none of these

Question 2

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

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

[princessflame2016]

Answer 1

21 hours.

Answer 2

22 hours.

[yoooooman]

Question 1

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

Using the critical-path algorithm to schedule this project with three processors results in a finishing time of
◦ 22 hours.
◦ 21 hours.
◦ 24 hours.
◦ 20 hours.
◦ none of these

Question 2

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

Using the critical-path algorithm to schedule this project with five processors results in a finishing time of
◦ 24 hours.
◦ 22 hours.
◦ 21 hours.
◦ 20 hours.
◦ none of these

[apple]

Answer 1

21 hours.

Answer 2

21 hours.

[CQXA]

Question 1

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

The length of the critical path of this project digraph is
◦ 11 hours.
◦ 16 hours.
◦ 12 hours.
◦ 14 hours.
◦ none of these

Question 2

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

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

[jaaaaaaa]

Answer 1

14 hours.

Answer 2

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