This topic contains a solution. Click here to go to the answer

Author Question: Suppose you have the following project digraph. (The numbers in parentheses represent hours.)The ... (Read 1205 times)

Tazate

  • Hero Member
  • *****
  • Posts: 532
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


Related Topics

Need homework help now?

Ask unlimited questions for free

Ask a Question

maya.nigrin17@yahoo.com

  • Sr. Member
  • ****
  • Posts: 324
This timeline is an optimal schedule.



stephzh

  • Hero Member
  • *****
  • Posts: 556
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

  • Sr. Member
  • ****
  • Posts: 286

D2AR0N

  • Hero Member
  • *****
  • Posts: 561
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

  • Sr. Member
  • ****
  • Posts: 317
This timeline is an illegal schedule.



Hungry!

  • Hero Member
  • *****
  • Posts: 1,071

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

  • Sr. Member
  • ****
  • Posts: 298

Chloeellawright

  • Hero Member
  • *****
  • Posts: 588

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

  • Sr. Member
  • ****
  • Posts: 344

 

Did you know?

Earwax has antimicrobial properties that reduce the viability of bacteria and fungus in the human ear.

Did you know?

Many of the drugs used by neuroscientists are derived from toxic plants and venomous animals (such as snakes, spiders, snails, and puffer fish).

Did you know?

Computer programs are available that crosscheck a new drug's possible trade name with all other trade names currently available. These programs detect dangerous similarities between names and alert the manufacturer of the drug.

Did you know?

Most women experience menopause in their 50s. However, in 1994, an Italian woman gave birth to a baby boy when she was 61 years old.

Did you know?

Long-term mental and physical effects from substance abuse include: paranoia, psychosis, immune deficiencies, and organ damage.

For a complete list of videos, visit our video library