unacademy gate 2023 cse aimt mock test 1

Question

What is the issue with the following version of Dekker’s Algorithm:

CSEnter(int i)

{

inside[i] = true;

While(inside[j])

{

inside[i] = false;

while (turn == j) continue;

inside[i] = true;

}

}

CSExit(int k)

{

turn = j;

inside[i]= false;

}

 

1. Deadlock is guaranteed

       b.Possibility of starvation

       c.Starvation never happen

       d.None of the above