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

Synchronization and Concurrency

Operating Systems

Previous Years Questions

Marks 1

More
Consider three concurrent processes P1, P2 and P3 as shown below, which access a shared variable D that has been initial...
GATE CSE 2019
The following two functions P1 and P2 that share a variable B with an initial value of 2 execute concurrently. P1( ) { ...
GATE CSE 2015 Set 1
A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some...
GATE CSE 2015 Set 1
Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared varia...
GATE CSE 2013
Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. ...
GATE CSE 2010
Which of the following scheduling algorithms is non-preemptive?
GATE CSE 2002
Where does the swap space reside?
GATE CSE 2001
Suppose a processor does not have any stack pointer register. Which of the following statements is true?
GATE CSE 2001
Let m[0] ..m[4] be mutexes (binary semaphores) and P[0] ...P[4] be processes. Suppose each process P[i] executes the fol...
GATE CSE 2000
A counting semaphore was initialized to 10. Then 6 P (wait) operations and 4 V (signal) operations were completed on thi...
GATE CSE 1998
When the result of a computation depends on the speed of the processes involved there is said to be
GATE CSE 1998
A critical section is a program segment
GATE CSE 1996

Marks 2

More
Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respective...
GATE CSE 2020
A certain computation generates two arrays a and b such that a[i]=f(i)for 0 ≤ i < n and b[i] = g (a[i] )for 0 ≤ i &lt...
GATE CSE 2013
A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the...
GATE CSE 2013
Fetch_And_Add (X, i) is an atomic Read-Modify-Write instruction that reads the value of memory location X, increments it...
GATE CSE 2012
The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0=1...
GATE CSE 2010
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instr...
GATE CSE 2009
The P and V operations on counting semaphores, where s is a counting semaphore, are defined as follows: P(s): s = s-1; ...
GATE CSE 2008
Two processes, P1 and P2, need to access a critical section of code. Consider the following synchronization construct us...
GATE CSE 2007
Barrier is a synchronization construct where a set of processes synchronizes globally i.e. each process in the set arriv...
GATE CSE 2006
Barrier is a synchronization construct where a set of processes synchronizes globally i.e. each process in the set arriv...
GATE CSE 2006
The atomic fetch-and-set x, y instruction unconditionally sets the memory location x to 1 and fetches the old value of x...
GATE CSE 2006
Suppose we want to synchronize two concurrent processes P and Q using binary semaphores S and T. The code for the proces...
GATE CSE 2003
Suppose we want to synchronize two concurrent processes P and Q using binary semaphores S and T. The code for the proces...
GATE CSE 2003
Consider Peterson’s algorithm for mutual exclusion between two concurrent processes i and j. The program executed by pro...
GATE CSE 2001
Each process Pi,i=1.....9 is coded as follows Repeat P(mutex){ critical section } V(mutex) Forever The co...
GATE CSE 1997
The concurrent programming constructs fork and join are as below: Fork (label) which creates a new process executing fr...
GATE CSE 1996
A solution to the Dining Philosophers Problem which avoids deadlock is
GATE CSE 1996
At a particular time of computation the value of a counting semaphore is 7. Then 20 P operations and 15 V operations wer...
GATE CSE 1992
Semaphore operations are atomic because they are implemented within the OS
GATE CSE 1990
A critical region is:
GATE CSE 1987

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