closed by
367 views

Related questions

5 votes
5 votes
1 answer
1
Suman Acharya asked Sep 13, 2017
4,282 views
In dining philosophers Algorithm the minimum number of forks or chopsticks to avoid deadlock is (assume there are 5 philosophers)a. 5b. 6c. 10d. None of these
0 votes
0 votes
0 answers
2
2 votes
2 votes
2 answers
4