My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Processes, Threads and Synchronization - Operating System - Computer Science & Information Technology Previous Year Questions

Practice Processes, Threads and Synchronization - Operating System - Computer Science & Information Technology previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

25Papers
17Years
44Questions
1Topics

Processes, Threads and Synchronization question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Processes, Threads and Synchronization. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 32 72.7%
Easy 10 22.7%
Hard 2 4.5%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 28 63.6%
MSQ 8 18.2%
Numerical Answer Type (NAT) 8 18.2%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
44 Qs

Most asked topics

Top topics across the included previous year papers.

Operating System
44 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Processes, Threads and Synchronization
44 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Computer Science and Information Technology (CS) 2026
1 Qs
Computer Science and Information Technology (CS) 2026
1 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
3 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
3 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
2 Qs
Computer Science & Information Technology (CS) 2013 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2010
2 Qs
Computer Science & Information Technology (CS) 2009
1 Qs
Computer Science & Information Technology (CS) 2008
3 Qs
Computer Science & Information Technology (CS) 2007
3 Qs

Included previous year papers

Newest papers appear first. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
Computer Science and Information Technology (CS) 202620261View paper
Computer Science and Information Technology (CS) 202620261View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20251View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20244View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20242View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20233View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20221View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20212View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20211View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20202View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20192View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20181View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20171View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20161View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20161View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20141View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20141View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20133View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20131View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20132View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20133View paper
Computer Science & Information Technology (CS) 201020102View paper
Computer Science & Information Technology (CS) 200920091View paper
Computer Science & Information Technology (CS) 200820083View paper
Computer Science & Information Technology (CS) 200720073View paper

All Processes, Threads and Synchronization previous year questions

Practice every matching question in batches of 20, with every available option.

1
2007 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2007

Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2.

Group 1Group 2
P. Gang Scheduling1. Guaranteed Scheduling
Q. Rate Monotonic Scheduling2. Real-time Scheduling
R. Fair Share Scheduling3. Thread Scheduling
Open complete paper
2
2007 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2007

Consider the following statements about user level threads and kernel level threads. Which one of the following statements is FALSE?

Open complete paper
3
2007 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2007
Two processes, P1 and P2, need to access a critical section of code. Consider the following synchronization construct used by the processes:
/* P1 */
while (true) {
  wants1 = true;
  while (wants2==true);
  /* Critical Section */
  wants1=false;
}
/* Remainder section */

/* P2 */
while (true) {
  wants2 = true;
  while (wants1==true);
  /* Critical Section */
  wants2=false;
}
/* Remainder section */
Here, wants1 and wants2 are shared variables, which are initialized to false. Which one of the following statements is TRUE about the above construct?
Open complete paper
4
2008 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2008
The P and V operations on counting semaphores, where s is a counting semaphore, are defined as follows:
P(s): s = s - 1;
if s < 0 then wait;
V(s): s = s + 1;
if s <= 0 then wakeup a process waiting on s;
Assume that Pb and Vb the wait and signal operations on binary semaphores are provided. Two binary semaphores xb and yb are used to implement the semaphore operations P(s) and V(s) as follows:
P(s) : Pb(xb);
s = s - 1;
if (s < 0) {
Vb(xb);
Pb(yb);
}
else Vb(xb);
V(s) : Pb(xb);
s = s + 1;
if (s <= 0) Vb(yb);
Vb(xb);
The initial values of xb and yb are respectively
Open complete paper
5
2008 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2008

Which of the following statements about synchronous and asynchronous I/O is NOT true?

Open complete paper
6
2008 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2008
A process executes the following code
for(i=0; i<n; i++) fork();
The total number of child processes created is
Open complete paper
7
2009 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2009
The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows :
void enter_CS(X)
{
  while (test-and-set(X));
}

void leave_CS(X)
{
  X=0;
}
In the above solution, X is a memory location associated with the CS and is initialized to 0. Now consider the following statements :
I. The above solution to CS problem is deadlock-free.
II. The solution is starvation free.
III. The processes enter CS in FIFO order.
IV. More than one process can enter CS at the same time.
Which of the above statements are TRUE ?
Open complete paper
8
2010 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2010
Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned.
Method used by P1Method used by P2
while (S1 == S2);
Critical Section
S1 = S2;		while (S1 != S2);
Critical Section
S2 = not(S1);

Which one of the following statements describes the properties achieved?
Open complete paper
9
2010 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2010
The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0=1, S1=0, S2=0.
Process P0Process P1Process P2
while (true) {
wait (S0);
print '0';
release (S1);
release (S2);
}		wait (S1);
release (S0);		wait (S2);
release (S0);

How many times will process P0 print '0'?
Open complete paper
10
2013 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2013 [Session 1]
Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?
Open complete paper
11
2013 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2013 [Session 1]
A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution?
Open complete paper
12
2013 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2013 [Session 1]
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 < n. Suppose this computation is decomposed into two concurrent processes X and Y such that X computes the array a and Y computes the array b. The processes employ two binary semaphores R and S, both initialized to zero. The array a is shared by the two processes. The structures of the processes are shown below.
Process X:
private i;
for (i=0; i a[i] = f(i);
ExitX(R, S);
}
Process Y:
private i;
for (i=0; i EntryY(R, S);
b[i] = g(a[i]);
}
Which one of the following represents the CORRECT implementations of ExitX and EntryY?
Open complete paper
13
2013 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2013 [Session 3]
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 < n. Suppose this computation is decomposed into two concurrent processes X and Y such that X computes the array a and Y computes the array b. The processes employ two binary semaphores R and S, both initialized to zero. The array a is shared by the two processes. The structures of the processes are shown below.

Process X:                                         Process Y:
private i;                                             private i;
for (i=0; i  a[i] = f(i);                                   EntryY(R, S);
  ExitX(R, S);                                    b[i] = g(a[i]);
}                                           }

Which one of the following represents the CORRECT implementations of ExitX and EntryY?
Open complete paper
14
2013 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2013 [Session 4]
Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b, and c; process Y executes the P operation on semaphores b, c, and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?
Open complete paper
15
2013 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2013 [Session 4]
A shared variable \(x\), initialized to zero, is operated on by four concurrent processes \(W, X, Y, Z\) as follows. Each of the processes \(W\) and \(X\) reads \(x\) from memory, increments by one, stores it to memory, and then terminates. Each of the processes \(Y\) and \(Z\) reads \(x\) from memory, decrements by two, stores it to memory, and then terminates. Each process before reading \(x\) invokes the \(P\) operation (i.e., wait) on a counting semaphore \(S\) and invokes the \(V\) operation (i.e., signal) on the semaphore \(S\) after storing \(x\) to memory. Semaphore \(S\) is initialized to two. What is the maximum possible value of \(x\) after all processes complete execution?
Open complete paper
16
2014 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2014 [Session 1]
Which one of the following is FALSE?
Open complete paper
17
2014 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2014 [Session 2]
Consider the procedure below for the Producer-Consumer problem which uses semaphores: semaphore n = 0;
semaphore s = 1;
void producer() { while(true) { produce(); semWait(s); addToBuffer(); semSignal(s); semSignal(n); } }
void consumer() { while(true) { semWait(s); semWait(n); removeFromBuffer(); semSignal(s); consume(); } } Which one of the following is TRUE?
Open complete paper
18
2016 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2016 [Session 1]
Consider the following proposed solution for the critical section problem. There are n processes: P0...Pn−1. In the code, function pmax returns an integer not smaller than any of its arguments. For all i, t[i] is initialized to zero.

Code for Pi:

do {
    c[i]=1; t[i] = pmax(t[0],...,t[n-1])+1; c[i]=0;
    for every j ≠ i in {0,...,n-1} {
        while (c[j]);
        while (t[j] != 0 && t[j]<=t[i]);
    }
    Critical Section;
    t[i]=0;
    Remainder Section;
} while (true);

Which one of the following is TRUE about the above solution?
Open complete paper
19
2016 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2016 [Session 2]
Consider the following proposed solution for the critical section problem. There are \( n \) processes: \( P_0 \ldots P_{n-1} \). In the code, function \( pmax \) returns an integer not smaller than any of its arguments. For all \( i \), \( t[i] \) is initialized to zero.

Code for \( P_i \):

do {
    c[i]=1; t[i] = pmax(t[0],...,t[n-1])+1; c[i]=0;
    for every \( j \neq i \) in {0,...,n-1} {
        while (c[j]);
        while (t[j] != 0 && t[j]<=t[i]);
    }
    Critical Section;
    t[i]=0;
    Remainder Section;
} while (true);

Which one of the following is TRUE about the above solution?
Open complete paper
20
2017 · Computer Science & Information Technology · Operating System · Processes, Threads and Synchronization
Computer Science & Information Technology (CS) 2017 [Session 2]
Which of the following is/are shared by all the threads in a process?
I. Program counter
II. Stack
III. Address space
IV. Registers
Open complete paper

Showing 20 of 41 questions