GATE CS 2022 (Forenoon) — Question 42

Operating Systems (OS)CPU and I/O SchedulingMCQ2 marks · −2/3 if wrongHard

Consider four processes P, Q, R, and S scheduled on a CPU as per round robin algorithm with a time quantum of 4 units. The processes arrive in the order P, Q, R, S, all at time \(t = 0\). There is exactly one context switch from S to Q, exactly one context switch from R to Q, and exactly two context switches from Q to R. There is no context switch from S to P. Switching to a ready process after the termination of another process is also considered a context switch. Which one of the following is NOT possible as CPU burst time (in time units) of these processes?
  1. A
    P = 4, Q = 10, R = 6, S = 2
  2. B
    P = 2, Q = 9, R = 5, S = 1
  3. C
    P = 4, Q = 12, R = 5, S = 4
  4. D
    P = 3, Q = 7, R = 7, S = 3
Practise the full 2022-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
Practise more on CPU and I/O SchedulingTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group