“Consider the following proposed solution to dining philosophers problem to avoid deadlock.
Consider the binary semaphore lock is initialized to 1.
Which of the following is correct?”
In the above question, is the given solution deadlock free? Will removing (iii) and (iv) can make the solution deadlock free?
