[Solved] A deadlock free solution to the dining philosophers problem

McqMate

Q.	A deadlock free solution to the dining philosophers problem
A.	necessarily eliminates the possibility of starvation
B.	does not necessarily eliminate the possibility of starvation
C.	eliminates any possibility of any kind of problem further
D.	none of the mentioned
Answer» B. does not necessarily eliminate the possibility of starvation

890

0

Do you find this helpful?

6

View all MCQs in

Operating System (OS)

Discussion

No comments yet

Related MCQs

The dining – philosophers problem will occur in case of
A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is?
Another solution to the problem of external fragmentation problem is to
Which of the following condition is required for a deadlock to be possible?
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?
Which one of the following is the deadlock avoidance algorithm?
For an effective operating system, when to check for deadlock?
Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?
To avoid deadlock
For a deadlock to arise, which of the following conditions must hold simultaneously?