Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

I just want the final solution as soon as possible. Thanks Question 31 Given processes and corresponding CPU burst times as in the table below,

I just want the final solution as soon as possible. Thanks

image text in transcribedimage text in transcribedimage text in transcribedimage text in transcribedimage text in transcribed

Question 31 Given processes and corresponding CPU burst times as in the table below, determine the order of execution for SJF scheduling. lot yet nswered Marked out of -00 - Flag question Process CPU Burst Time A 5 B 12 | 7 D 8 E 2 a. ABCDE O b. None of these O c. EACDB O d. EDCBA O e. ECADB stion 32 yet wered Assume you have the following jobs to execute with one processor: Note: 1: highest; 5: lowest ked out of Process Priority Flag question A B D E Anival Time 0 0 15 30 40 CPU Burst time 35 25 15 15 15 4 2 3 2 1 Using a preemptive priority scheduling with no cost context switching, what is the tumaround time for process A O a. 105 O b. 120 O c. 70 O d. 55 estion 33 t yet swered orked out of 0 Flag question Suppose that the following processes arrive for execution at time zero. Use Round Robin scheduling algorithm if the Quantum time (time slice = 2). What is the Average waiting time? Process Burst Time P1 9 P2 5 P3 12 P4 6 P5 7 O a. 23.8 ms O b. 21.8 ms O c. 25.8 ms d. 18.8 ms O e. 26.8 ms Question 34 Not yet Enswered Marked out of 2.00 P Flag question Suppose that the following processes arrive for execution at the times indicated. Use Shortest Remaining Time First SRTF (preemptive SJF) scheduling to answer the following, Find the waiting time for each process. Process Arrival Burst Time Time P1 15 P2 6 7 P4 8 P5 15 0 3 P3 9 4 3 O a. P1=22, P2=0, P3=9, P4=1, P5=0 O b. P1=22, P2=0, P3=6, P4=1, P5=2 O c. P1=22, P2=0, P3=9, P4=1, P5=5 O d. P1=22, P2=1, P3=9, P4=1, P5=0 Etion 35 yet wered ced out of Suppose that the following processes arrive for execution at time zero. Use Round Robin scheduling algorithm if the Quantum time time slice=2). Assume that at time t=19 a new process P6 with burst time 9 enters the system, determine the order of execution of the ready Queue at t=20? ag question Process P1 P2 P3 P4 P5 Burst Time 9 5 12 6 7 O a. P1, P2, P3, P4, P5, P6 O b. P5, P1, P3, P2, P4, P6 O c. P2, P3, P4, P5, P6 O d. P6, P5, P1, P2, P3, P4 O e. P5, P1, P6, P2, P3, P4

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Advanced Database Systems

Authors: Carlo Zaniolo, Stefano Ceri, Christos Faloutsos, Richard T. Snodgrass, V.S. Subrahmanian, Roberto Zicari

1st Edition

155860443X, 978-1558604438

More Books

Students also viewed these Databases questions