UGC NET CSE | June 2016 | Part 2 | Question: 40

Question

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 declares next process to be scheduled. If teh process have no I/O operations and all arrive at time zero, then the schduler implements ___ criteria

• A. Priority scheduling
• B. Rond Robin Scheduling
• C. Shortest Job First
• D. FCFS

Answer 1

The scheduling algorithm works as Round Robin algorithm with quantum time equals to t. After a process's turn comes and it has executed for t units, its waiting time becomes least and its turn comes again after every other process has got the chance for t units.

B is answer

Comments

@ Anirudh what if priority is inversely proportional to the waiting time of a process ??

Answer 2

As per question 10 cpu-bound processes arrives @ same time at time 0 so waiting time is same for all processes so same priority also as per question.

So here Round Robin with Time Quantum="T"