New RBI Grade B 2025 Notification will come Soon! Enroll Here

    Question

    In the context of preemptive CPU scheduling, which of

    the following algorithms can potentially cause starvation, and how can this issue be mitigated? 
    A First-Come, First-Served (FCFS) Correct Answer Incorrect Answer
    B Shortest Job First (SJF) Correct Answer Incorrect Answer
    C Shortest Remaining Time First (SRTF) Correct Answer Incorrect Answer
    D Round Robin (RR) Correct Answer Incorrect Answer
    E Priority Scheduling Correct Answer Incorrect Answer

    Solution

    Priority scheduling assigns priorities to processes, with higher priority processes getting executed first. However, this can lead to starvation if lower-priority processes are continually bypassed in favor of higher-priority processes. Starvation occurs when a low-priority process may never get executed, particularly if there is a steady stream of higher-priority processes. This issue can be mitigated using a technique called  aging , where the priority of processes that have waited too long is gradually increased, ensuring that all processes eventually get CPU time. Why Other Options are Incorrect: A) FCFS: FCFS is a non-preemptive algorithm and does not cause starvation; processes are executed in the order of their arrival. B) SJF: SJF is non-preemptive and doesn’t cause starvation directly, though its preemptive counterpart (SRTF) might. C) SRTF: SRTF can cause starvation, but it is not as likely as Priority Scheduling since processes with shorter burst times will eventually complete. D) Round Robin: Round Robin uses time slices, so all processes get a fair share of the CPU, preventing starvation.

    Practice Next

    Relevant for Exams: