84. Which of the following scheduling algorithm is impossible to implement?
(a) FCFS Scheduling
(b) Priority Scheduling
(c) Shortest Job First (SJF) Scheduling
(d) None of these
Answers
Answer:
priority scheduling is b option
Answer:
The Scheduling algorithm impossible to implement is (c) Shortest Job First (SJF) Scheduling.
Explanation:
The SJF booking Scheduling is provably ideal, in that it gives the base normal sitting tight time for a given arrangement of procedures. By moving a short procedure before a long one, holding up time of the short procedure diminishes more than it builds the holding up time of the long procedure. Thus, the normal holding up time diminishes.
The genuine trouble with the SJF Scheduling is difficulty in knowing the length of the following CPU demand. SJF planning is utilized every now and again in long hauls booking. In spite of the fact that the SJF Scheduling is ideal, it can't be executed at the degree of momentary CPU planning. There is no real way to know the length of the following CPU burst.