The Bounded Buffer problem is also known as the ________.

Explanation

The classic Bounded Buffer problem has one or more producer processes inserting items into a fixed-size shared buffer and one or more consumer processes removing them, synchronised with semaphores or monitors so producers block when the buffer is full and consumers block when it is empty. This is exactly the setup textbooks define as the Producer–Consumer problem, and the two names are used interchangeably. The Reader–Writer problem instead concerns concurrent read/write access to shared data, and the Dining Philosophers problem models circular resource contention, so neither matches the bounded-capacity-buffer scenario, making option (i) correct.