Question

The real difficulty with SJF in short term scheduling is :

a) it is too good an algorithm
b) knowing the length of the next CPU request
c) it is too complex to understand
d) None of these

Answer 1

The difficulty with SJF scheduling lies in knowing the length of the next CPU request, as it requires prediction of job duration before starting, which is often not feasible.

Step-by-step explanation:

The real difficulty with Shortest Job First (SJF) in short term scheduling is not that it is too good an algorithm, nor that it is too complex to understand. The main challenge is knowing the length of the next CPU request, which is answer b. This is because SJF relies on predicting how long each job will take before it starts, which can be incredibly difficult or impossible in practice. Therefore, the correct choice from the provided options is 'b) knowing the length of the next CPU request'.