Suppose we want to synchronize two concurrent processes P and Q using binary…
GATE · 2003 · CS
Suppose we want to synchronize two concurrent processes P and Q using binary semaphores S and T. The code for the processes P and Q is shown below.
Process P:
while (1) {
W:
print '0';
print '0';
X:
}
Process Q:
while (1) {
Y:
print '1';
print '1';
Z:
}Synchronization statements can be inserted only at points W, X, Y and Z.
Which of the following will always lead to an output starting with '001100110011' ?
- A.
P(S) at W, V(S) at X, P(T) at Y, V(T) at Z, S and T initially 1
- B.
P(S) at W, V(T) at X, P(T) at Y, V(S) at Z, S initially 1, and T initially 0
- C.
P(S) at W, V(T) at X, P(T) at Y, V(S) at Z, S and T initially 1
- D.
P(S) at W, V(S) at X, P(T) at Y, V(T) at Z, S initially 1, and T initially 0
Attempted by 382 students.
Sign up free to check your answer
Sign up freeLoading lesson…