Preemptive Shortest Job First (SJF) scheduling is also known by which standard operating system acronym?
Option A is correct. SRTF (Shortest Remaining Time First) is the preemptive version of SJF, where a newly arrived process with a shorter remaining CPU burst than the current process preempts the CPU.
In Round Robin (RR) scheduling, if the Time Quantum is extremely large (approaching infinity), the behavior of Round Robin degenerates to which algorithm?
Option B is correct. If the time quantum is very large, no process is preempted by the timer, so processes run to completion in order of arrival, matching FCFS.
What happens if the Time Quantum in Round Robin (RR) CPU scheduling is set extremely small (e.g., 1 microsecond)?
Option C is correct. If the time quantum is too small, context switches will occur very frequently, causing high CPU overhead and reducing effective processor utilization.
What major issue can affect Priority Scheduling and Shortest Job First (SJF) algorithms, where low-priority or long processes wait indefinitely?
Option B is correct. Starvation occurs when low-priority processes are repeatedly preempted or bypassed by higher-priority/shorter processes.
Which technique is used to solve the problem of starvation in priority-based CPU scheduling algorithms?
Option A is correct. Aging is a technique of gradually increasing the priority of processes that wait in the system for a long time, ensuring they eventually execute.