'The Dining Philosopher' problem can be solved by: $$ \text{(a) Use of semaphores } $$ $$ \text{ (b) Use of overlays } $$ $$ \text{ (c) Mutual exclusion } $$ $$ \text{(d) Bounded waiting} $$
The Dining Philosopher problem is a classic synchronization problem that illustrates issues like deadlock and resource contention. It involves philosophers sitting at a table, each needing two forks (shared resources) to eat.
To prevent deadlock and ensure proper synchronization, we can use:
Other options like overlays, mutual exclusion, and bounded waiting are concepts related to process management, but the direct mechanism to solve this problem is the use of semaphores.
Answer: (a) Use of semaphores
Reinforce your conceptual grasp with related questions from CUET-MCA 2025:
Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.
Start Free Mock Test Series →