Question: 20
(Choose 1 answer)
Analyze the relationship between the dining philosophers problem and the use of semaphores or mutexes in
concurrent programming, outlining the potential for deadlock situations and solutions.
A. The dining philosophers problem exemplifies the need for thread priorities in deadlock resolution.
B. Semaphores and mutexes help prevent deadlocks by allowing multiple processes to access critical
sections simultaneously.
C. The dining philosophers problem demonstrates how shared resources, managed by semaphores or
mutexes, can lead to deadlock situations without proper synchronization.
D. Semaphores and mutexes are ineffective in resolving the dining philosophers problem, as it primarily deals
with scheduling issues.
