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?

Single correct

Source: GATE CSE 2025 Set 1 (CS1), IIT Roorkee. Official question paper.

GATE CSE 2025 | Set 2 | Question 26

CPU Scheduling

MCQ1 mark

Processes

P1

P2

P3

P4

arrive in that order at times 0, 1, 2, and 8 milliseconds respectively, and have execution times of 10, 13, 6, and 9 milliseconds respectively. Shortest Remaining Time First (SRTF) algorithm is used as the CPU scheduling policy. Ignore context switching times. Which ONE of the following correctly gives the average turnaround time of the four processes in milliseconds?

Single correct

Source: GATE CSE 2025 Set 2 (CS2), IIT Roorkee. Official question paper.

GATE CSE 2024 | Set 2 | Question 37

CPU Scheduling

MCQ2 marks

Consider a single processor system with four processes A, B, C, and D, represented as given below, where for each process the first value is its arrival time, and the second value is its CPU burst time. A (0, 10), B (2, 6), C (4, 3), and D (6, 7). Which one of the following options gives the average waiting times when preemptive Shortest Remaining Time First (SRTF) and Non-Preemptive Shortest Job First (NP-SJF) CPU scheduling algorithms are applied to the processes?

Single correct

Source: GATE CSE 2024 Set 2 (CS2), IISc Bengaluru. Official question paper.

GATE CSE 2022 | Question 42

CPU Scheduling

MCQ2 marks

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?

Single correct

Answer key coming soon

Source: GATE CSE 2022, IIT Kharagpur. Official question paper.

GATE CSE 2016 | Set 1 | Question 20

CPU Scheduling

MCQ1 mark

Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?

Single correct

Answer key coming soon

Source: GATE CSE 2016 Set 1, IISc Bengaluru. Official question paper.

GATE CSE 2015 | Set 3 | Question 57

CPU Scheduling

MCQ2 marks

For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?

\begin{array}{|c|c|c|} \hline \text{Process} & \text{Arrival Time} & \text{Processing Time} \\ \hline A & 0 & 3 \\ B & 1 & 6 \\ C & 4 & 4 \\ D & 6 & 2 \\ \hline \end{array}

Single correct

Source: GATE CSE 2015 Set 3, IIT Kanpur. Official question paper and answer key.

GATE CSE 2013 | Question 10

CPU Scheduling

MCQ1 mark

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every

T

time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?

Single correct

Answer key coming soon

Source: GATE CSE 2013, IIT Bombay. Official question paper (booklet code A).

GATE CSE 2012 | Question 31

CPU Scheduling

MCQ2 marks

Consider the 3 processes, P1, P2 and P3 shown in the table.

\begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arrival time} & \textbf{Time Units Required} \\ \hline P1 & 0 & 5 \\ P2 & 1 & 7 \\ P3 & 3 & 4 \\ \hline \end{array}

The completion order of the 3 processes under the policies FCFS and RR2 (round robin scheduling with CPU quantum of 2 time units) are

Single correct

Answer key coming soon

Source: GATE CSE 2012. Official question paper (booklet code A).

GATE CSE 2011 | Question 35

CPU Scheduling

MCQ2 marks

Consider the following table of arrival time and burst time for three processes P0, P1 and P2.

\begin{array}{|c|c|c|} \hline \text{Process} & \text{Arrival time} & \text{Burst Time} \\ \hline P0 & 0 \text{ ms} & 9 \text{ ms} \\ P1 & 1 \text{ ms} & 4 \text{ ms} \\ P2 & 2 \text{ ms} & 9 \text{ ms} \\ \hline \end{array}

The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes?

Single correct

Answer key coming soon

Source: GATE CSE 2011, IIT Madras. Official question paper.

Use ← → to move

Questions

10 total

Correct Wrong Answer seen

Sort

FiltersClear all

Year

Set

Set

Marks

Marks

Question type

Question type