Class Synchronization

In the bounded buffer problem, there are the empty and full semaphores that : a) count the number of empty and full buffers b) count the number of empty and full memory spaces c) count the number of empty and full queues d) None of these

a

The dining - philosophers problem will occur in case of : a) 5 philosophers and 5 chopsticks b) 4 philosophers and 5 chopsticks c) 3 philosophers and 5 chopsticks d) 6 philosophers and 5 chopsticks

a

To ensure difficulties do not arise in the readers - writers problem, _______ are given exclusive access to the shared object. a) readers b) writers c) None of these

a

A deadlock free solution to the dining philosophers problem: a) necessarily eliminates the possibility of starvation b) does not necessarily eliminate the possibility of starvation c) eliminates any possibility of any kind of problem further d) None of these

b

The bounded buffer problem is also known as: a) Readers - Writers problem b) Dining - Philosophers problem c) Producer - Consumer problem d) None of these

c