1
GATE CSE 2024 Set 1
MCQ (Single Correct Answer)
+2
-0.66

Consider the following two threads T1 and T2 that update two shared variables a and b. Assume that initially $a = 1$ and $b = 1$. Though context switching between threads can happen at any time, each statement of T1 or T2 is executed atomically without interruption.

T1:
$a = a + 1$;
$b = b + 1$;

T2:
$b = 2 * b$;
$a = 2 * a$;

Which one of the following options lists all the possible combinations of values of a and b after both T1 and T2 finish execution?

A

$(a = 4, b = 4); (a = 3, b = 3); (a = 4, b = 3)$

B

$(a = 3, b = 4); (a = 4, b = 3); (a = 3, b = 3)$

C

$(a = 4, b = 4); (a = 4, b = 3); (a = 3, b = 4)$

D

$(a = 2, b = 2); (a = 2, b = 3); (a = 3, b = 4)$

2
GATE CSE 2024 Set 1
Numerical
+2
-0.66

Consider the following code snippet using the fork() and wait() system calls. Assume that the code compiles and runs correctly, and that the system calls run successfully without any errors.

int x = 3;
while(x > 0) {
  fork();
  printf("hello");
  wait(NULL);
  x--;
}

The total number of times the printf statement is executed is _______

Your input ____
3
GATE CSE 2023
MCQ (Single Correct Answer)
+2
-0.67

Consider the two functions incr and decr shown below.


incr() {
  wait(s);
  X = X+1;
  signal(s);
}

decr() {
   wait(s);
   X = X-1;
   signal(s);
}

There are 5 threads each invoking incr once, and 3 threads each invoking decr once, on the same shared variable X. The initial value of X is 10.

Suppose there are two implementations of the semaphore s, as follows:

I-1: s is a binary semaphore initialized to 1.

I-2: s is a counting semaphore initialized to 2.

Let V1, V2 be the values of X at the end of execution of all the threads with implementations I-1, I-2, respectively.

Which one of the following choices corresponds to the minimum possible values of V1, V2, respectively?

A
15, 7
B
7, 7
C
12, 7
D
12, 8
4
GATE CSE 2021 Set 2
MCQ (More than One Correct Answer)
+2
-0

Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and freeing of resources are done by holding a global lock (L). The following scheme is used to own a resource instance:

function OWNRESOURCES(Resource R)

Acquire lock L / / a global lock

if R is available then

Acquire R

Release lock L

else

if R is owned by another process P then

Terminate P, after releasing all resources owned by P

Acquire R

Restart P

Release lock L

end if

end if

end function

Which of the following choice(s) about the above scheme is/are correct?

A
The scheme may lead to starvation.
B
The scheme may lead to live-lock.
C
The scheme ensures that deadlocks will not occur.
D
The scheme violates the mutual exclusion property.
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12