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

[Tazate]

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

Consider the following timeline using two processors.

◦ This timeline is an optimal schedule.
◦ This is the timeline one gets using the critical-path algorithm.
◦ This is the timeline one gets using the decreasing-time algorithm.
◦ This timeline is an illegal schedule.
◦ none of these

[maya.nigrin17@yahoo.com]

This timeline is an optimal schedule.

[stephzh]

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

Consider the following timeline using two processors.

◦ This is the timeline one gets using the critical-path algorithm.
◦ This is the timeline one gets using the decreasing-time algorithm.
◦ This timeline is an illegal schedule.
◦ This timeline is an optimal schedule.
◦ none of these

[lou]

none of these

[D2AR0N]

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

Consider the following timeline using two processors.

◦ This is the timeline one gets using the critical-path algorithm.
◦ This timeline is an optimal schedule.
◦ This timeline is an illegal schedule.
◦ This is the timeline one gets using the decreasing-time algorithm.
◦ none of these

[canderson530]

This timeline is an illegal schedule.

[Hungry!]

Question 1

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

The length of the critical path from C is
◦ 15 hours.
◦ 20 hours.
◦ 7 hours.
◦ 12 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
◦ 15 hours.
◦ 11 hours.
◦ 22 hours.
◦ 4 hours.
◦ none of these

[jjorrostieta]

Answer 1

15 hours.

Answer 2

15 hours.

[Chloeellawright]

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
◦ 18 hours.
◦ 37 hours.
◦ 15 hours.
◦ 30 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
◦ 22 hours.
◦ 18 hours.
◦ 19 hours.
◦ 23 hours.
◦ none of these

[Tabitha_2016]

Answer 1

18 hours.

Answer 2

19 hours.