GATEverse Practice, past papers & mock tests
GATE 2013 · session-1
Operating SystemsProcess Management-IeasyMCQ1 mark
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?
Save your progress

Related Operating Systems PYQs