GATE CSE 2026 Session 2 Q23: CPU scheduling algorithm that cannot be preemptive
- Operating System
- 1 mark
- MCQ
- −1/3 if wrong
Question
Which one of the following CPU scheduling algorithms cannot be preemptive?
Try it: multiple choice: exactly one correct option
Wrong answer costs 1/3 mark in GATE.
Show answer and explanation
Answer: B (official GATE 2026 final answer key)
Concept used: Preemption takes the CPU away from a running process before it finishes or blocks.
First step: For each algorithm, ask whether anything can interrupt the running process.
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2026 Session 2 CS question paper and final answer key, organised by IIT Guwahati. Question paper · Answer key
More Operating System PYQs
- 2026 Session 1 · Q29False statements about deadlocks
- 2026 Session 1 · Q35Minimum resource instances for deadlock freedom (5 processes, max 2)
- 2026 Session 1 · Q59Disk transfer time for random sectors on tracks 5, 12, 7
- 2026 Session 1 · Q63Number of printf calls with fork, continue and break
- 2026 Session 1 · Q64Average FCFS waiting time for alternating A and C processes
- 2026 Session 2 · Q51Possible output patterns of three processes using two semaphores