...
Theory-of-Computation
March 6, 2024
Question 4074 – UGC NET CS 2005 Dec-Paper-2
March 6, 2024
Theory-of-Computation
March 6, 2024
Question 4074 – UGC NET CS 2005 Dec-Paper-2
March 6, 2024

Question 7809 – Operating-Systems

Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below:

These processes are run on a single processor using preemptive Shortest Remaining Time First scheduling algorithm. If the average waiting time of the processes is 1 millisecond, then the value of Z is _____.

Correct Answer: A

Question 8 Explanation: 
This is the Gantt chart till time = 4 units

At this point P4 arrives with burst ‘Z’ & P3 is in queue with burst 3.
P1 & P2 have executed with P1 incurred delay 1unit & P2 0units.
Hence, Avg = 0+1+x/4 =1
⇒ x=3, the next delay should be 3. It would happen if assume Z=2.
It executes and completes at 6.
P3 will wait totally for 3units.
Hence, Avg=1.

Z=2
A
2
B
7
C
1
D
4
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!