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

[mmm]

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 two processors, the project finishing time is
◦ 20 hours.
◦ 18 hours.
◦ 17 hours.
◦ 19 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 two processors, the total combined idle time of the two processors is
◦ 5 hours.
◦ 3 hours.
◦ 7 hours.
◦ 1 hour.
◦ none of these

[samiel-sayed]

Answer 1

18 hours.

Answer 2

3 hours.

[itsmyluck]

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, the project finishing time is
◦ 12 hours.
◦ 13 hours.
◦ 11 hours.
◦ 14 hours.
◦ none of these

Question 2

A project consists of five tasks. The lengths of the tasks (in hours) are 5, 4, 4, 3, and 3. The tasks are all independent (i.e., there are no precedence relations).

Using the critical-path algorithm to schedule the project with two processors, the finishing time is
◦ 12 hours.
◦ 9 hours.
◦ 10 hours.
◦ 11 hours.
◦ none of these

[olderstudent]

Answer 1

14 hours.

Answer 2

11 hours.