Answer:
The shortest job first is the most suitable scheduling policy to use here as it selects the waiting process with the minimum execution time to execute next.
Step-by-step explanation:
There are five jobs waiting to run with the following expected times:
9, 6, 3, 5 and X
We have to find the order in which they should run to minimize average response time.
So we will use shortest job first scheduling technique. As the answer depends on X. So the order can be:
- When X=0 Then order is: X, 3, 5, 6, 9
- When X is greater than 3 but less than 5 (3 < X < =5 ) the order is 3, X, 5 ,6, 9
- When X is greater than 5 but less than 6 (5 < X < = 6) the order is 3, 5, X, 6, 9
- When X is greater than 6 but less than 9 (6 < X < =9) then order is 3, 5 ,6 , X ,9
- When X is greater than 9 (X>9) Then the order is 3 , 5 , 6 , 9 ,X