Davinder Singh
Davinder Singh - 3 years ago in Processes

Occurrence of dining – philosophers problem

[A] 5 philosophers and 5 chopsticks
[B] 4 philosophers and 5 chopsticks
[C] 3 philosophers and 5 chopsticks
[D] 6 philosophers and 5 chopsticks
Loading...

Overall Stats

Attempted 87
Correct 17
Incorrect 21
Viewed 49

Answers

Guest
Guest
Sabina Sunuwar
Sabina Sunuwar - 8 months ago

Sabina Sunuwar from Dang, Nepal is saying 5 philosophers and 5 chopsticks is correct answer

Nazia Sayed
Nazia Sayed - 1 year ago

Nazia Sayed from Mumbai, India is saying 3 philosophers and 5 chopsticks is correct answer

Nazia Sayed
Nazia Sayed - 1 year ago

Nazia Sayed from Mumbai, India is saying 3 philosophers and 5 chopsticks is correct answer

Francis Rai
Francis Rai - 1 year ago

Francis Rai from Assam, India is saying 5 philosophers and 5 chopsticks is correct answer

Sanjiv Sanjivgupta
Sanjiv Sanjivgupta - 1 year ago

Sanjiv Sanjivgupta from Kolkata, India is saying 5 philosophers and 5 chopsticks is correct answer

Related Questions

Davinder Singh
Davinder Singh - 3 years ago in Processes
Result of forcibly remove process from the cpu :
  • [A] Interrupt
  • [B] create new process
  • [C] backlog
  • [D] none
Davinder Singh
Davinder Singh - 3 years ago in Processes
Necessary Conditions for deadlock can occur
  • [A] No Mutual Exclusion, Hold and Wait, Circular Wait, Preemption.
  • [B] No Mutual Exclusion, Circular Wait,Preemption, Hold and Wait..
  • [C] No Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait.
  • [D] No Preemption, No Mutual Exclusion,Hold and Wait, Circular Wait.
Davinder Singh
Davinder Singh - 3 years ago in Processes
Mutual exclusion can be provided by the
  • [A] mutex locks
  • [B] binary semaphores
  • [C] both (a) and (b)
  • [D] none of the mentioned
Davinder Singh
Davinder Singh - 3 years ago in Processes
Which of the following algorithm have Belady's anamoly?
  • [A] Optimal replacement
  • [B] FIFO
  • [C] LRU
  • [D] both in FIFO and LRU