Question

40. 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. (1) priority scheduling (2) round robin scheduling (3) shortest job first (4) fcfs

Answer 1

Answer:

what is the meaning of this question