Memory-Management
August 13, 2024UGC NET June-2019 CS Paper-2
August 13, 2024ISRO CS 2009
|
Question 16
|
Consider a set of 5 processes whose arrival time, CPU time needed and the priority are given below:
(smaller the number, higher the priority)
If the CPU scheduling policy is priority scheduling without preemption, the average waiting time will be
(smaller the number, higher the priority)
If the CPU scheduling policy is priority scheduling without preemption, the average waiting time will be
|
12.8 ms
|
|
|
11.8 ms
|
|
|
10.8 ms
|
|
|
9.8 ms
|
Question 16 Explanation:
Following is the Gantt diagram:
Average Waiting Time = (30 + 3 + 3 + 18)/ 5 = 10.8
Correct Answer: C
Question 16 Explanation:
Following is the Gantt diagram:
Average Waiting Time = (30 + 3 + 3 + 18)/ 5 = 10.8