Which of the following CPU scheduling algorithms t...
Guiding State PSC aspirants since 2016 50,000+ students · 1,000+ final selections Exam Calendar Results Call 9116926003
pscnotes
Pick your state
GPSC Prelims previous year questions

Which of the following CPU scheduling algorithms tends to favour processes with substantial CPU execution requirements by allowing them to retain the processor until they terminate or voluntarily enter a waiting state?

Asked in GPSC ICT Officer, Class-2 2026

  1. Shortest Job First (SJF), which prioritizes processes based on their estimated CPU burst duration
  2. First-Come, First-Served (FCFS), which allocates processor time according to the chronological order of process arrival
  3. Round Robin, which distributes processor time among processes using fixed time slices in a cyclic order
  4. Multilevel Queue Scheduling, which classifies processes into separate queues according to predefined scheduling criteria
Show answer

Answer: B. First-Come, First-Served (FCFS), which allocates processor time according to the chronological order of process arrival

This previous-year question came without the commission's answer key; the answer was checked by AI. Always confirm with the official key.

More GPSC Prelims previous year questions questions

All 18,593 GPSC Prelims previous year questions questions →