CPU Scheduling


Q41.

Feedback queues
GateOverflow

Q42.

Four jobs to be executed on a single processor system arrive at time 0 in the order A,B,C,D. Their burst CPU time requirements are 4,1,8,1 time units respectively. The completion time of A under round robin scheduling with time slice of one time unit is
GateOverflow

Q43.

Feedback queues
GateOverflow

Q44.

If the time-slice used in the round-robin scheduling policy is more than the maximum time required to execute any process, then the policy will
GateOverflow

Q45.

Consider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR, assume that the processes are scheduled in the order P_1,P_2,P_3,P_4. If the time quantum for RR is 4 ms, then the absolute value of the difference between the average turnaround times (in ms) of SJF and RR (round off to 2 decimal places is_______
GateOverflow