Consider the following code to solve critical section problem for to process p0 and p1. Initially flag(i) contain false for i= 0&1.
While (1)
{ Flag(i)= true;
While (flag (j));
//Cs
Flag(i)=false;
Remaining section
}
Assume that i referred to the current process pi and j refers to the other process Pj. If two Processes executing above code concurrently then which of the following does not satisfy the code?
Mutual Exclusion and progress
Mutual exclusion and bounded wait
Progress and bounded wait
None of these
I think progress is not satisfied...but bounded wait and mutual exclusion is satisfied...
Correct if I m wrong
