Pearson Crack The Gate Series Unit 7 Chapter 2 Practice Problems I Question 11

Question

Consider two process P, and P, which share the following variables:

boolean flag [2]; /*initially false*/

int turn;

These two processes, Pi(i = 0 or 1), Pj (j = 1 or 0) execute the following code:

do

{

flag [i] = TRUE;

while (flag [ j ])

{

if ( turn =  = j ) 

{

flag[ i ] = FALSE;

while ( turn == j );

flag[ i ] = TRUE;
}
}

//Critical Section

turn = j;

flag[ i ] = FALSE;

//remainder
}

while( TRUE );

 

The Code Satisfies

(i) Mutual Exclusion

(ii) Progress

(iii) Bounded Waiting

• A. (i) , (ii) only
• B. (ii), (iii) only
• C. (i), (iii) only
• D. (I), (ii), (iii)