Back to the 2025 paper

Module 3: Inter-process Communication

20252m

The Dining Philosopher Algorithm is a classic example of which problem?

(i) CPU scheduling
(ii) Memory fragmentation
(iii) Process synchronization and deadlock
(iv) File allocation

Worked SolutionAI Assisted

Answer: (iii) Process synchronization and deadlock

Dining philosophers share forks (resources); illustrates synchronization, deadlock, starvation. Classic IPC problem solved by semaphores/monitors.

Similar questions

Official AppAndroid App

PYQDeck for Android

Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.