Question 11
What is the preemptive version of Shortest Job First (SJF) scheduling called?
SRTF preempts the currently running process if a newly arrived process has a shorter remaining CPU burst time.
What is the preemptive version of Shortest Job First (SJF) scheduling called?
SRTF preempts the currently running process if a newly arrived process has a shorter remaining CPU burst time.
In Round Robin CPU scheduling, if the time quantum is very large, it behaves like -
If the time quantum exceeds the longest process burst time, Round Robin degenerates into non-preemptive FCFS.
In Round Robin CPU scheduling, if the time quantum is extremely small, it leads to -
An excessively small time quantum causes frequent context switches, spending more CPU time on overhead than actual work.
Which technique resolves the problem of starvation in Priority Scheduling?
Aging gradually increases the priority of processes waiting in the queue for a long time, ensuring eventual execution.
The total time taken from process submission to its completion is known as -
Turnaround Time = Completion Time - Submission/Arrival Time.