Open In App
Related Articles

GATE | GATE-CS-2001 | Question 47

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
Consider Peterson’s algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below.
   repeat   
      flag [i] = true; 
      turn = j; 
      while ( P ) do no-op; 
      Enter critical section, perform actions, then exit critical 
      section 
      flag [ i ] = false; 
      Perform other non-critical section actions. 
   until false; 
For the program to guarantee mutual exclusion, the predicate P in the while loop should be. (A) flag[j] = true and turn = i (B) flag[j] = true and turn = j (C) flag[i] = true and turn = j (D) flag[i] = true and turn = i

Answer: (B)

Explanation: See question 2 of https://www.geeksforgeeks.org/operating-systems-set-2/

Quiz of this Question

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads