Consider the following two-process synchronization soultion
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 in initialized to zero.
Which one of the following is TRUE?

Open in App

Solution

Given problem is strict alteration problem in which one process go into critical section or not is decided by non critical section of another process.
So, progress property is not satisfied.

Suggest Corrections

Similar questions

Q. 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 programe to guarantee mutual exclusion, the predicate P in the while loop should be

Q. Consider the following code of processes 'i' & 'j'
int lock = 0, turn;
void process (int i)
{
int j = NOT(i);
while (1)
{
turn = i;
while (lock ! = 0 && turn = = i);
lock = 1;
<CS>
lock = 0;
}
Which of the following is true?

Q. Consider the following proposed solution for the critical section problem. There are n processes:

P_{0} . . . 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?

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 P1	Method used by P2
while (S1 == S2); Critica1 Section S1 = S2;	while (S1 != S2); Critica1 Section S2 = not (S1);

Which one of the following statements describes the properties achieved?

Q. 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 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?

Join BYJU'S Learning Program

Consider the following two-process synchronization soultion 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 in initialized to zero. Which one of the following is TRUE?

Given problem is strict alteration problem in which one process go into critical section or not is decided by non critical section of another process. So, progress property is not satisfied.

Consider the following two-process synchronization soultion
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 in initialized to zero.
Which one of the following is TRUE?

Given problem is strict alteration problem in which one process go into critical section or not is decided by non critical section of another process.
So, progress property is not satisfied.