GATE CS 2025 (Forenoon) — Question 38

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

A computer has two processors, \( M_1 \) and \( M_2 \). Four processes \( P_1, P_2, P_3, P_4 \) with CPU bursts of 20, 16, 25, and 10 milliseconds, respectively, arrive at the same time and these are the only processes in the system. The scheduler uses non-preemptive priority scheduling, with priorities decided as follows: • \( M_1 \) uses priority of execution for the processes as, \( P_1 > P_3 > P_2 > P_4 \), i.e., \( P_1 \) and \( P_4 \) have highest and lowest priorities, respectively. • \( M_2 \) uses priority of execution for the processes as, \( P_2 > P_3 > P_4 > P_1 \), i.e., \( P_2 \) and \( P_1 \) have highest and lowest priorities, respectively. A process \( P_i \) is scheduled to a processor \( M_k \), if the processor is free and no other process \( P_j \) is waiting with higher priority. At any given point of time, a process can be allocated to any one of the free processors without violating the execution priority rules. Ignore the context switch time. What will be the average waiting time of the processes in milliseconds?
  1. A
    9.00
  2. B
    8.75
  3. C
    6.50
  4. D
    7.50
Practise the full 2025-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkOperating System Concepts (Galvin)Scheduling, synchronisation, deadlocks, memory and file systems.
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