Exams › GATE › Technical

Consider the following two-process synchronization solution. Process 0 -------- Entry: loop while (turn == 1); (critical section) Exit: turn = 1; Process 1 -------- Entry: loop while (turn == 0); (critical section) Exit: turn = 0; The shared variable turn is initialized to zero. Which one of the following is TRUE?

1. This is a correct two-process synchronization solution.
2. This solution violates mutual exclusion requirement.
3. This solution violates progress requirement.
4. This solution violates bounded wait requirement.

Correct answer: This solution violates progress requirement.

Solution

The solution violates the progress requirement because if one process enters its critical section, the other process may be indefinitely delayed if it keeps waiting for the turn variable to change, leading to a situation where neither process can proceed.

Related GATE Technical questions

• We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then repeats. The minimum number of J-K flip-flops required to implement this counter is
• A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queue)?
• Consider the following C program. void f(int, short); void main() { int i = 100; short s = 12; short *p = &s; ________; // call to f() } Which one of the following expressions, when placed in the blank above, will NOT result in a type checking error?
• The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:
• Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest path between any pair of vertices does not change
• Consider the following C program. #include<stdio.h> void mystery(int *ptra, int *ptrb) { int *temp; temp = ptrb; ptrb = ptra; ptra = temp; } int main() { int a=2016, b=0, c=4, d=42; mystery(&a, &b); if (a < c) mystery(&c, &a); mystery(&a, &d); printf("%d ", a); } The output of the program is _________.

⚔️ Practice GATE Technical free + battle 1v1 →