Post by: audragclark on May 5, 2020
Question 1
Suppose you have the project consisting of the six tasks described in the following table.
Which project digraph below models the project described?
◦
◦
◦
◦
◦ none of these
Question 2
Suppose you have the following project digraph. (The numbers in parentheses represent hours.)
The number of tasks in the project is
◦ 8.
◦ 6.
◦ 9.
◦ 7.
◦ none of these
Post by: xthemafja on May 5, 2020
Answer 1
Answer 2
6.Post by: maychende on May 5, 2020
Question 1
Suppose you have the following project digraph. (The numbers in parentheses represent hours.)
The number of tasks in the project is
◦ 7.
◦ 9.
◦ 8.
◦ 10.
◦ none of these
Question 2
Suppose you have the following project digraph. (The numbers in parentheses represent hours.)
What is the number of tasks in this project?
◦ 11
◦ 9
◦ 6
◦ 7
◦ none of these
Post by: tennis14576 on May 5, 2020
Answer 1
7.Answer 2
7Post by: ts19998 on May 5, 2020
Using the priority list, C, F, E, B, A, D and the priority-list model to schedule this project with two processors results in a finishing time of
◦ 22 hours.
◦ 18 hours.
◦ 23 hours.
◦ 19 hours.
◦ none of these
Post by: Missbam101 on May 5, 2020
Post by: burchfield96 on May 5, 2020
Using the priority list, C, E, G, F, B, A, D and the priority-list model to schedule this project with two processors results in a finishing time of
◦ 24 hours.
◦ 21 hours.
◦ 26 hours.
◦ 22 hours.
◦ none of these
Post by: xMRAZ on May 5, 2020
Post by: misspop on May 5, 2020
Using the priority list F, E, A, D, B, G, C and the priority-list model to schedule this project with two processors, the project finishing time is
◦ 22 hours.
◦ 17 hours.
◦ 18 hours.
◦ 21 hours.
◦ none of these
Post by: pangili4 on May 5, 2020
Post by: Deast7027 on May 5, 2020
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
Post by: kkenney on May 5, 2020
Post by: naturalchemist on May 5, 2020
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
Post by: momo1250 on May 5, 2020
Post by: kodithompson on May 5, 2020
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
Post by: jharrington11 on May 5, 2020
Answer 1
Answer 2
22 hours.Post by: fox on May 5, 2020
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
Post by: wtf444 on May 5, 2020
Answer 1
26 hours.Answer 2
task A to one processor, task C to the other one.Post by: Melani1276 on May 5, 2020
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
Post by: Jane on May 5, 2020
Answer 1
20 hours.Answer 2
7 hours.Post by: Deast7027 on May 5, 2020
Consider the following timeline using three processors.
◦ This timeline is an illegal schedule because task F was started before task E was completed.
◦ This timeline is an illegal schedule because task E was started before task C was completed.
◦ This timeline is not an optimal schedule because the project can be scheduled with a finishing time of 11 hours.
◦ This timeline is an optimal schedule for three processors.
◦ none of these
Post by: Loise Hard on May 5, 2020
Post by: sjones on May 5, 2020
Consider the following timeline using three processors.
◦ This timeline is not optimal because task F was started after processor 3 was idle for 2 hours.
◦ This timeline is not an optimal schedule because the project can be scheduled with a finishing time of 12 hours.
◦ This timeline is an illegal schedule because task E was started before task C was completed.
◦ This timeline is an optimal schedule for three processors.
◦ none of these
Post by: jomama on May 5, 2020
Post by: jhjkgdfhk on May 5, 2020
Consider the following timeline using two processors.
◦ This timeline is an optimal schedule.
◦ This is the timeline one gets using the decreasing-time algorithm.
◦ This is the timeline one gets using the critical-path algorithm.
◦ This timeline is an illegal schedule.
◦ none of these
Post by: djpooyouma on May 5, 2020
Post by: mydiamond on May 5, 2020
Consider the following timeline using two processors.
◦ This timeline is an illegal schedule.
◦ This timeline is an optimal schedule.
◦ This is the timeline one gets using the decreasing-time algorithm.
◦ This is the timeline one gets using the critical-path algorithm.
◦ none of these
Post by: Joy Chen on May 5, 2020
Post by: bio_gurl on May 5, 2020
Consider the following timeline using two processors.
◦ This timeline is an optimal schedule.
◦ This timeline is an illegal schedule.
◦ This is the timeline one gets using the decreasing-time algorithm.
◦ This is the timeline one gets using the critical-path algorithm.
◦ none of these
Post by: frre432 on May 5, 2020
Post by: Tazate on May 5, 2020
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
Post by: maya.nigrin17@yahoo.com on May 5, 2020
Post by: stephzh on May 5, 2020
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
Post by: lou on May 5, 2020
Post by: D2AR0N on May 5, 2020
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
Post by: canderson530 on May 5, 2020
Post by: Hungry! on May 5, 2020
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
Post by: jjorrostieta on May 5, 2020
Answer 1
15 hours.Answer 2
15 hours.Post by: Chloeellawright on May 5, 2020
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
Post by: Tabitha_2016 on May 5, 2020
Answer 1
18 hours.Answer 2
19 hours.Post by: cherise1989 on May 5, 2020
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
Post by: triiciiaa on May 5, 2020
Answer 1
18 hours.Answer 2
18 hours.Post by: beccaep on May 5, 2020
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
Post by: perkiness on May 5, 2020
Answer 1
8 hours.Answer 2
18 hours.Post by: nramada on May 5, 2020
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
Post by: princessflame2016 on May 5, 2020
Answer 1
21 hours.Answer 2
22 hours.Post by: yoooooman on May 5, 2020
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
Post by: apple on May 5, 2020
Answer 1
21 hours.Answer 2
21 hours.Post by: CQXA on May 5, 2020
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
Post by: jaaaaaaa on May 5, 2020
Answer 1
14 hours.Answer 2
task B to one processor, task C to the other one.Post by: mmm on May 5, 2020
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
Post by: samiel-sayed on May 5, 2020
Answer 1
18 hours.Answer 2
3 hours.Post by: itsmyluck on May 5, 2020
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
Post by: olderstudent on May 5, 2020
Answer 1
14 hours.Answer 2
11 hours.