GATE 2023 CS – Question 27
Operating System · CPU and I/O Scheduling · 1 mark · Multiple select
Which one or more of the following CPU scheduling algorithms can potentially cause starvation?
- First-in First-Out
- Round Robin
- Priority Scheduling
- Shortest Job First
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (C) Priority Scheduling; (D) Shortest Job First
Explanation
Priority scheduling and SJF can indefinitely postpone low-priority or long jobs. FIFO and Round Robin serve every process in bounded time.
More CPU and I/O Scheduling questions
- GATE 2022 CS Q42 – Consider four processes P, Q, R, and S scheduled on a CPU as per round robin algorithm…
- GATE 2021 CS (CS1) Q35 – Three processes arrive at time zero with CPU bursts of 16, 20 and 10 milliseconds. If the…
- GATE 2020 CS Q60 – Consider the following set of processes, assumed to have arrived at time 0. Consider the…
- GATE 2019 CS Q51 – Consider the following four processes with arrival times (in milliseconds) and their…
- GATE 2018 CS Q63 – Consider a storage disk with 4 platters (numbered as 0, 1, 2 and 3), 200 cylinders…
- GATE 2015 CS (CS1) Q52 – Consider a uniprocessor system executing three tasks T 1, T 2 and T 3, each of which is…
All CPU and I/O Scheduling questions →