edited by
1,056 views
2 votes
2 votes

Consider the following proposed solution to dining Philosopher’s problem to avoid deadlock. Consider the binary semaphore lock is initialized to 1.

Which of the following is correct?

Removing (i) and (ii) will not affect the code. The code will still work fine.

Removing (iii) and (iv) will not affect the code. The code still work fine.

Removing both (i), (ii), (iii) and (iv) will not affect the code. The code will still work fine.

All (i), (ii), (iii) and (iv) are necessary. Removal of any of them will affect the code.

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
3 answers
2