Which of the following is not related to synchronization in Operating System ?

Question

Accepted Answer

The correct option is (4):
Belady's Anomaly is the correct answer because it is fundamentally related to memory management, not process synchronization. Specifically, it is a phenomenon observed in certain page replacement algorithms (like FIFO) where increasing the number of available page frames in main memory actually leads to an *increase* in the number of page faults. This concept is a property of virtual memory performance and the efficiency of an algorithm, dealing with the relationship between memory allocation and page fault rate. It does not involve the coordination or mutual exclusion of multiple independent processes accessing a shared critical resource, which is the definition of a synchronization problem.

The incorrect option is (1):
The Bounded Buffer problem, also famously known as the Producer-Consumer problem, is a classical, textbook example of a process synchronization problem. It involves two processes—a producer and a consumer—who share a fixed-size buffer. Synchronization is absolutely crucial here to prevent a catastrophic race condition: the producer must be blocked from adding an item if the buffer is full, and the consumer must be blocked from removing an item if the buffer is empty. Solutions to this problem rely heavily on synchronization primitives such as semaphores or mutexes to enforce orderly access.

The incorrect option is (2):
The Readers-Writers problem is another foundational synchronization challenge in operating systems. It addresses the scenario where multiple processes must share access to a single data area, such as a file or a database record. The synchronization requirement is that multiple 'Reader' processes can access the data concurrently, as they do not modify it. However, a 'Writer' process requires mutual exclusion, meaning only one writer can be active at a time, and no readers can access the resource simultaneously with a writer. This complex access control is implemented purely through synchronization logic.

The incorrect option is (3):
The Dining Philosophers problem is a canonical synchronization problem used to demonstrate the issues of deadlock and starvation in concurrent systems. It models a scenario where multiple processes (philosophers) must compete for limited, non-preemptable resources (forks) to complete their task (eating). The goal of solving this problem is to design a synchronization scheme that prevents all philosophers from becoming deadlocked (each holding one fork and waiting indefinitely for the second). Therefore, finding a safe and efficient solution is an exercise in complex concurrency control.