A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates 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
Answer:Round Robin Scheduling
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: