GATE CS 2023 Set 1 — Question 27

MSQ+1 / -0MediumProcess SchedulingOperating System

Operating System → Process Scheduling

Last updated 5 September 2026

Question

Which one or more of the following CPU scheduling algorithms can potentially cause starvation?

Answer checking is unavailable for this question. You can review the published solution without a score.

Solution Starvation means a ready process can wait indefinitely because the scheduler keeps choosing other processes. (C) Priority Scheduling — can starve. If higher-priority processes keep arriving, a low-priority process may never run (unless aging is used). (D) Shortest Job First — can starve. If shorter jobs keep arriving, a long job can be postponed indefinitely. (B) Round Robin — cannot starve. Every ready process gets a time quantum in each cycle, so its waiting time is bounded. (A) First-In First-Out — debatable. Every process is served in arrival order, so normally none starves; it can only "starve" others if a process ahead of them never finishes (e.g., an infinite loop), which is why some argue for including it. The standard answer is C, D . The official GATE 2023 answer key accepts either A, C, D or C, D . Because the grader cannot accept two different option sets for a multiple-select question, marks are awarded to all for this question. Turn this into a strength. Explore AI-powered practice and doubt support with Success Tracker.

Review answer and solution without JavaScript

Interactive answer checking needs JavaScript. The published solution is available below.

Solution Starvation means a ready process can wait indefinitely because the scheduler keeps choosing other processes. (C) Priority Scheduling — can starve. If higher-priority processes keep arriving, a low-priority process may never run (unless aging is used). (D) Shortest Job First — can starve. If shorter jobs keep arriving, a long job can be postponed indefinitely. (B) Round Robin — cannot starve. Every ready process gets a time quantum in each cycle, so its waiting time is bounded. (A) First-In First-Out — debatable. Every process is served in arrival order, so normally none starves; it can only "starve" others if a process ahead of them never finishes (e.g., an infinite loop), which is why some argue for including it. The standard answer is C, D . The official GATE 2023 answer key accepts either A, C, D or C, D . Because the grader cannot accept two different option sets for a multiple-select question, marks are awarded to all for this question.

Continue learning with Success Tracker

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans

PYQs with solutions: Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts: Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support: Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.