A solution to the Dining Philosophers Problem which avoids deadlock is
GATE · 1996 · CS · Question 2 subpartsTPSC Computer/IT Posts · 2025 · Senior Informatics Officer · Section D
A solution to the Dining Philosophers Problem which avoids deadlock is
- A.
ensure that all philosophers pick up the left fork before the right fork
- B.
ensure that all philosophers pick up the right fork before the left fork
- C.
ensure that one particular philosopher picks up the left fork before the right fork, and that all other philosophers pick up the right fork before the left fork
- D.
none of these
Attempted by 896 students.
Sign up free to check your answer
Sign up freeLoading lesson…