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?
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?
2
GATE CSE 2019
Numerical
+1
-0
The following C program is executed on a Unix/Linux system:
The total number of child processes created is _____.
#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?
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
Questions Asked from Process Concepts and Cpu Scheduling (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (1)
GATE CSE 2023 (2)
GATE CSE 2021 Set 2 (1)
GATE CSE 2021 Set 1 (1)
GATE CSE 2020 (1)
GATE CSE 2019 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2014 Set 1 (1)
GATE CSE 2013 (1)
GATE CSE 2012 (1)
GATE CSE 2011 (3)
GATE CSE 2010 (1)
GATE CSE 2009 (1)
GATE CSE 2007 (2)
GATE CSE 2006 (1)
GATE CSE 2004 (1)
GATE CSE 2002 (1)
GATE CSE 2001 (3)
GATE CSE 1999 (1)
GATE CSE 1998 (2)
GATE CSE 1996 (2)
GATE CSE 1995 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages