Computer Sciences > GATE 2014 SET-3 > CPU Scheduling
An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds):
The average waiting time (in milliseconds) of the processes is _________.
Correct : 5.5
Similar Questions
Consider the following statements about process state transitions for a system using preemptive scheduling.
I. A running process can move to ready state.
II....
Which of the following CPU scheduling algorithm can potential cause starvation?
Consider a single processor system with four processes A, B, C, and D, represented as given below, where for each process the first value is its arrival time, a...
Total Unique Visitors
Loading......