engineering computer science MCQ #1815

Which scheduling algorithm is prone to starvation?

engineering computer science MCQ #1815

  1. Question 1

    Q1. Which scheduling algorithm is prone to starvation?

    • A) First-Come-First-Served (FCFS)
    • B) Shortest Job First (SJF)
    • C) Priority Scheduling
    • D) Round Robin (RR)

    Answer: Priority Scheduling

    Explanation: Priority Scheduling can lead to starvation if a process with low priority is indefinitely delayed by higher-priority processes.