1
GATE CSE 2020
MCQ (Single Correct Answer)
+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.
II. A ready 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
2
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 _____.
Your input ____
3
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+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
4
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+1
-0.3
The maximum number of processes that can be in $$Ready$$ state for a computer system with $$n$$ $$CPUs$$ is
A
$$n$$
B
$${n^2}$$
C
$${2^n}$$
D
Independent of $$n$$
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12