A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler reevaluates the process priority for every ‘T’ time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements _________ criteria.**(A)** Priority scheduling**(B)** Round Robin Scheduling**(C)** Shortest Job First**(D)** FCFS**Answer:** **(B)****Explanation:** A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler reevaluates the process priority for every ‘T’ time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements **Round Robin Scheduling** criteria.

So, option (B) is correct.

Quiz of this Question

DSA Self Paced Course

View Details