MadeEasy Test Series: Operating System - Process Synchronization

Question

question : 

Comments

In order to solve dining philosophers problem(I mean Deadlock should not occur ), the condition is If there are N philosophers and among them, if N-1 philosophers are eating spaghetti from left fork first and then right fork then if N^th philosopher is eating spaghetti from right fork first and then left fork then deadlock will never occur.

If at least one philosopher is eating from a right fork and then left fork then deadlock will never occur..

In the above question, Both options are perfectly fine and correct too...

---

https://gateoverflow.in/2748/gate1996-2-19

Answer 1

To avoid deadlock in Dining Philosophers Problem there are two simple solutions . Consider there are N philisophers

1.   (N-1) Philosopers First Take Left Fork then Right Fork , Last Philosopher Take Right and then Left
2.  All philoposher sitting in ODD position take Left Fork then Right Fork , All philosophers sitting in EVEN position take right fork first then Left Fork .

Assuming option b is telling the point number 2 . hence both should be correct .

Reference

• http://adit.io/posts/2013-05-11-The-Dining-Philosophers-Problem-With-Ron-Swanson.html