Question 7995 – Operating-Systems
March 11, 2024Question 9137 – Sliding-Window-Protocol
March 11, 2024Process-Scheduling
|
Question 18
|
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 __________.
|
29
|
|
|
30
|
|
|
31
|
|
|
32
|
Question 18 Explanation:
Waiting Time = 0 + (33 – 5) + (40 – 2) + (49 – 12) + (51 – 9) = 145
Average waiting time: 145/5 = 29
Correct Answer: A
Question 18 Explanation:
Waiting Time = 0 + (33 – 5) + (40 – 2) + (49 – 12) + (51 – 9) = 145
Average waiting time: 145/5 = 29