GATE 2012 CS (CS1) – Question 41

Operating System · CPU and I/O Scheduling · 2 marks · Multiple choice

Processes P₁,P₂,P₃ have (arrival,CPU time) (0,5),(1,7),(3,4). Find completion orders for FCFS and round robin with quantum two.

FCFS P₁,P₂,P₃; RR₂ P₁,P₂,P₃
FCFS P₁,P₃,P₂; RR₂ P₁,P₃,P₂
FCFS P₁,P₂,P₃; RR₂ P₁,P₃,P₂
FCFS P₁,P₃,P₂; RR₂ P₁,P₂,P₃

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) FCFS P₁,P₂,P₃; RR₂ P₁,P₃,P₂

Explanation

FCFS runs in arrival order, completing P₁,P₂,P₃. RR timeline is P₁:0–2, P₂:2–4, P₁:4–6, P₃:6–8, P₂:8–10, P₁:10–11, P₃:11–13, P₂:13–16. Thus RR completes P₁,P₃,P₂. Select C.

More CPU and I/O Scheduling questions

GATE 2013 CS (CS1) Q20 – Priorities are proportional to process waiting times and start at zero. Every T time units…
GATE 2011 CS (CS1) Q45 – Processes P₀,P₁,P₂ have arrivals 0,1,2 ms and bursts 9,4,9 ms respectively. Use preemptive…
GATE 2010 CS (CS1) Q35 – Which are true? I: Shortest remaining time first may cause starvation. II: Preemptive…
GATE 2015 CS (CS3) Q57 – Processes have (arrival,processing) times A=(0,3), B=(1,6), C=(4,4), D=(6,2). Which policy…
GATE 2021 CS (CS2) Q24 – Which statements about CPU scheduling are correct?
GATE 2026 CS (CS1) Q64 – Consider a CPU that has to execute two types of processes. The first type, Actuators (A),…

All CPU and I/O Scheduling questions →