NEW
New Website Launch
Experience the best way to solve previous year questions with mock tests (very detailed analysis), bookmark your favourite questions, practice etc...
VISIT NOW

GATE CSE

Process Concepts and Cpu Scheduling

Operating Systems

Previous Years Questions

Marks 1

More
Consider four processes P, Q, R and S scheduled on a CPU as per round robin algorithm with a time quantum of 4 units. Th...
GATE CSE 2022
Consider the following statements about process state transitions for a system using preemptive scheduling. I. A running...
GATE CSE 2020
The following C program is executed on a Unix/Linux system: #include < unistd.h > int mai...
GATE CSE 2019
Consider an arbitrary set of $$CPU$$-bound processes with unequal $$CPU$$ burst lengths submitted at the same time to a ...
GATE CSE 2016 Set 1
The maximum number of processes that can be in $$Ready$$ state for a computer system with $$n$$ $$CPUs$$ is
GATE CSE 2015 Set 3
Which one of the following is FALSE?
GATE CSE 2014 Set 1
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priorit...
GATE CSE 2013
A process executes the code fork $$\left( {\,\,\,} \right);$$ fork $$\left( {\,\,\,} \right);$$ fork $$\left( {\,\,\,} ...
GATE CSE 2012
A thread is usually defined as a ''light weight process'' because an operating system $$(OS)$$ maintains smaller data st...
GATE CSE 2011
Let the time taken to switch between user and kernel modes of execution be $${t_1}$$ while the time taken to switch betw...
GATE CSE 2011
A Computer handles several interrupt sources of which the following are relevant for this question: $$ * \,\,\,$$ Interr...
GATE CSE 2011
Which of the following statements are true? $${\rm I}.$$ Shortest remaining time first scheduling may cause starvation $...
GATE CSE 2010
A CPU generally handles an interrupt by executing an interrupt service routine
GATE CSE 2009
Consider the following statements about user level threads and kernel level threads. Which one of the following stateme...
GATE CSE 2007
Group-1 contains some $$CPU$$ scheduling algorithms and Group-2 contains some applications. Match entries in Group-1 to ...
GATE CSE 2007
Consider three $$CPU$$-intensive process, which require $$10,20$$ and $$30$$ time units and arrive at times $$0,2$$ and ...
GATE CSE 2006
Consider the following statements with respect to user-level threads and kernel-supported threads. i) Context switch is...
GATE CSE 2004
Which of the following scheduling algorithms is non-preemptive?
GATE CSE 2002
Consider a set of $$n$$ tasks with known runtimes $${r_1},{r_2},.....\,{r_n}\,\,$$ to be run on a uniprocessor machine. ...
GATE CSE 2001
A processor needs software interrupt to
GATE CSE 2001
A CPU has two modes-privileged and non-privileged. In order to change the mode from privileged to non-privileged
GATE CSE 2001
System calls are usually invoked by using:
GATE CSE 1999
Consider $$n$$ processes sharing the $$CPU$$ in a round-robin fashion. Assuming that each process switch takes $$s$$ sec...
GATE CSE 1998
Which of the following is an example of spooled device?
GATE CSE 1998
Which of the following is an example of spooled device?
GATE CSE 1996
The process state transition diagram in Figure is representative of ...
GATE CSE 1996
Which scheduling policy is most suitable for a time-shared operating systems?
GATE CSE 1995

Marks 2

More
Which of the following standard C library functions will always invoke a system call when executed from a single-threade...
GATE CSE 2021 Set 1
Consider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Short...
GATE CSE 2020
Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in millisecon...
GATE CSE 2019
Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The sched...
GATE CSE 2016 Set 2
For the processes listed in the following table, which of the following scheduling schemes will give the lowest average ...
GATE CSE 2015 Set 3
Consider a uniprocessor system executing three tasks T1, T2 and T3, each of which is composed of an infinite sequence of...
GATE CSE 2015 Set 1
Consider the following set of processes that need to be scheduled on a single $$CPU.$$ All the times are given in millis...
GATE CSE 2014 Set 1
An operating system uses $$shortest$$ $$remaining$$ $$time$$ $$first$$ scheduling algorithm for pre-emptive scheduling o...
GATE CSE 2014 Set 3
Three processes $$A, B$$ and $$C$$ each execute a loop of $$100$$ iterations. In each iteration of the loop, a process p...
GATE CSE 2014 Set 2
Consider the $$3$$ processes, $$P1,$$ $$P2$$ and $$P3$$ shown in the table. .tg {border-collapse:collapse;border-spac...
GATE CSE 2012
Consider the following table of arrival time and burst time for three processes $$P0,P1$$ and $$P2$$. .tg {border-coll...
GATE CSE 2011
In the following process state transition diagram for a uniprocessor system, assume that there are always some processes...
GATE CSE 2009
Which of the following is/are true of the auto-increment addressing mode? $${\rm I}.\,\,\,$$ It is useful in creating se...
GATE CSE 2008
A process executes the following code for (i = 0; i < n; i + +) fork ( ); The total number of child processes create...
GATE CSE 2008
An operating system uses Shortest Remaining Time first $$(SRT)$$ process scheduling algorithm. Consider the arrival time...
GATE CSE 2007
Consider three processes, all arriving at time zero, with total execution time of $$10,20,$$ and $$30$$ units, respectiv...
GATE CSE 2006
Consider three processes (process id $$0,1,2,$$ respectively) with compute time bursts $$2, 4,$$ and $$8$$ time units. A...
GATE CSE 2006
Consider the following code fragment: if (fork() == 0) { a = a + 5; printf("%d, %d \n", a, &a); } else { a...
GATE CSE 2005
Consider the following set of processes, with the arrival times and the $$CPU$$-burst times given in milliseconds. Wh...
GATE CSE 2004
A uni-processor computer system only has two processes, both of which alternate $$10$$ $$ms$$ $$CPU$$ bursts with $$90$$...
GATE CSE 2003
Which combination of the following features will suffice to characterize an $$OS$$ as a multi-programmed $$OS?$$ $$(a).$...
GATE CSE 2002
Draw the process state transition diagram of an $$OS$$ in which (i) each process is in one of the five states: created,...
GATE CSE 2002
Which of the following does not interrupt a running process?
GATE CSE 2001
Which of the following actions is/are typically not performed by the operating system when switching context from proces...
GATE CSE 1999
A multi-user, multi-processing operating system cannot be implemented on hardware that does not support:
GATE CSE 1999
Four jobs are waiting to be run. Their expected run times are $$6, 3, 5$$ and $$x$$. $${\rm I}$$n what order should they...
GATE CSE 1998
Four jobs to be executed on a single processor system arrive at time $${0^ + }$$ in the order $$A, B, C, D.$$ their bur...
GATE CSE 1996
The sequence $$.........$$ is an optimal non-preemptive scheduling sequence for the following jobs which leaves the $$CP...
GATE CSE 1995
Assume that the following jobs are to be executed on a single processor system. .tg {border-collapse:collapse;border-...
GATE CSE 1993
The details of an interrupt cycle are shown in Figure Given that an interrupt input arrives every $$1$$ $$msec,$$ what...
GATE CSE 1993
Which of the following is an example of a spooled device?
GATE CSE 1992
The highest-response ratio next scheduling policy favours $$.......$$ jobs, but it also limits the waiting time of $$ .....
GATE CSE 1990
State an undesirable characteristic of each of the following criteria for measuring performance of an operating system: ...
GATE CSE 1988

Joint Entrance Examination

JEE Main JEE Advanced WB JEE

Graduate Aptitude Test in Engineering

GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN

Medical

NEET

CBSE

Class 12