Zeal Test Series 2019: Operating System - Process Schedule

Question

ANSWER IS C) BUT I AM NOT GETTING HOW 2ND IS CORRECT

 

Answer 1

In Shortest Job First the priority is given to the shortest job first . So it is also a kind of priority scheduling algorithm . In priority scheduling algorithm generally the priority are given earlier based on user defined parameter whereas in SJF the priority is on the basis of the burst time. That is why 2 is also correct

Answer 2

1. TQ is infinite then RR is same as FCFS. ence FCFS is subset of RR.

2. In SJF priority is same as burst time. Hence subset of priority scheduling.

So C is correct.

Comments

1. If the time quantum is very large, the RR policy is the same as the FCFS policy
2. An SJF algorithm is simply a priority algorithm where the priority is the inverse of the CPU burst