...
Question 7995 – Operating-Systems
March 11, 2024
Question 9137 – Sliding-Window-Protocol
March 11, 2024
Question 7995 – Operating-Systems
March 11, 2024
Question 9137 – Sliding-Window-Protocol
March 11, 2024

Question 8013 – Operating-Systems

Consider the set of processes with arrival time (in milliseconds), CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. None of the processes have I/O burst time.

The average waiting time (in milliseconds) of all the processes using preemptive priority scheduling algorithm is __________.

Correct Answer: A

Question 25 Explanation: 

Waiting Time = 0 + (33 – 5) + (40 – 2) + (49 – 12) + (51 – 9) = 145
Average waiting time: 145/5 = 29
A
29
B
30
C
31
D
32
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!!