Register

Operating System

569 views
0 votes
0 votes

In Dining philosopher's problem, there are 8 number of diners and X number of chopsticks. What is the minimum value of X which ensures that therewill be no deadlock
 

Note: Even number philosopher takes left fork first and odd number philosopher takes right fork first.

User Avatar

1 Answer

0 votes
0 votes

The 8 philosopher will take 1 fork each and then remaining one fork can be taken by any philosopher to break deadlock, if any is formed.

So: Total forks =  8+1 = 9 forks

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
jaydip74 asked Jan 28
285 views
Operating System
How much time is required to load a 64 KB program from a disk with an average seek time of 30 ms, a rotation time of 20 ms per rotation, a track size of 32 KB, and a page size of 2 KB. It is assumed that the pages are spread randomly around the disk. A. 1200 ms B. 1300 ms C. 1320 ms D. 1400 ms
How much time is required to load a 64 KB program from a disk with an average seek time of 30 ms, a rotation time of 20 ms per rotation, a track size of 32 KB, and a page...
User Avatar
0 votes
0 votes
1 answer
2
Overflow04 asked Jan 7, 2023
697 views
Operating System
When a page is referred for the first time, then it will be counted in page fault or not?. E.g page reference 1,2,3,4,2,1. LRU is used with 3 frames(initially empty).
When a page is referred for the first time, then it will be counted in page fault or not?.E.g page reference 1,2,3,4,2,1.LRU is used with 3 frames(initially empty).
User Avatar
0 votes
0 votes
0 answers
4
Arbaz__Malik asked Dec 25, 2021
643 views
self-doubt operating-system semaphore
given solution is wait(P) , wait(Q), wait(p) , wait(Q) for s1,s2,s3,s4 respectively I know this implementation is deadlock free just want to ask if it will follow bounded waiting and progress and how both of them are different?
given solution is wait(P) , wait(Q), wait(p) , wait(Q) for s1,s2,s3,s4 respectivelyI know this implementation is deadlock free just want to ask if it will follow bounded ...
User Avatar
Link Copied!