1
GATE CSE 2022
+1
-0.33

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?

A
P = 4, Q = 10, R = 6, S = 2
B
P = 2, Q = 9, R = 5, S = 1
C
P = 4, Q = 12, R = 5, S = 4
D
P = 3, Q = 7, R = 7, S = 3
2
GATE CSE 2020
+1
-0.33
Consider the following statements about process state transitions for a system using preemptive scheduling.

I. A running process can move to ready state.
III. A blocked process can move to running state.
IV. A blocked process can move to ready state.

Which of the above statements are TRUE?
A
I, II and III only
B
II and III only
C
I, II and IV only
D
I, II, III and IV
3
GATE CSE 2019
Numerical
+1
-0.33
The following C program is executed on a Unix/Linux system:

         #include < unistd.h >
int main ()
{
int i ;
for (i=0; i<10; i++)
if (i%2 == 0) fork ( ) ;
return 0 ;
}

The total number of child processes created is _____.
4
GATE CSE 2016 Set 1
+1
-0.3
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?
A
Shortest remaining time first
B
Round-robin with time quantum less than the shortest $$CPU$$ burst
C
Uniform random
D
Highest priority first with priority proportional to $$CPU$$ burst length
GATE CSE Subjects
EXAM MAP
Medical
NEET