Menu

[Solved]6 Processes System Arrive Order Popp2 Burst Time Arrival Time Shown Arrival Time Burst Tim Q37272853

help
6. Processes in a system arrive in the order PoP.P2 with burst time and arrival time shown below: Arrival Time Burst Time Pro6. Processes in a system arrive in the order PoP.P2 with burst time and arrival time shown below: Arrival Time Burst Time Process 5 8 If first-come-frist-served FCFS scheduling algorithm is used, what is the average waiting time of the processes? A. O 5 B.06 C. O7 D. O 7.3 E. O 8.3 F. O 4.8 7. In the above question, if non-preemptive shortest-job-first (SJF) scheduling algorithm is used, what is the average turn around time of the processes? A. O9 B. O 9.3 D. O 12.3 Е.о 13 F. O 4.3 8. Which of the following is not true about a multilevel feedback queue (MLF also called exponential queue) scheduling algorithm? A. O I/O-bound jobs are likely to stay at high priority levels. B. o CPU-bound jobs are likely to drop in prorities quickly C. O The quantum of an unfinished job increases exponentially D. O A freshly created job is run at the level with highest priority E. O Starvation may occur 9. In priority scheduling, what type of processes should be given a higher priori (Choose the best answer.) A. O CPU-bound processes B. O Compiling processes C. O Computing-intensive processes D. O IO-bound processes E. O Hydrid processes of various kinds Show transcribed image text 6. Processes in a system arrive in the order PoP.P2 with burst time and arrival time shown below: Arrival Time Burst Time Process 5 8 If first-come-frist-served FCFS scheduling algorithm is used, what is the average waiting time of the processes? A. O 5 B.06 C. O7 D. O 7.3 E. O 8.3 F. O 4.8 7. In the above question, if non-preemptive shortest-job-first (SJF) scheduling algorithm is used, what is the average turn around time of the processes? A. O9 B. O 9.3 D. O 12.3 Е.о 13 F. O 4.3 8. Which of the following is not true about a multilevel feedback queue (MLF also called exponential queue) scheduling algorithm? A. O I/O-bound jobs are likely to stay at high priority levels. B. o CPU-bound jobs are likely to drop in prorities quickly C. O The quantum of an unfinished job increases exponentially D. O A freshly created job is run at the level with highest priority E. O Starvation may occur 9. In priority scheduling, what type of processes should be given a higher priori (Choose the best answer.) A. O CPU-bound processes B. O Compiling processes C. O Computing-intensive processes D. O IO-bound processes E. O Hydrid processes of various kinds

Expert Answer


Answer to 6. Processes in a system arrive in the order PoP.P2 with burst time and arrival time shown below: Arrival Time Burst Tim… . . .

OR


Leave a Reply

Your email address will not be published. Required fields are marked *