Classic Synchronization Problems - Operating System Questions and Answers

  • 1. The bounded buffer problem is also known as :
   A.) Readers – Writers problem
   B.) Dining – Philosophers problem
   C.) Producer – Consumer problem
   D.) None of these

Answer: Option 'C'

Producer – Consumer problem

  • 2. 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

Answer: Option 'A'

count the number of empty and full buffers

  • 3. In the bounded buffer problem :
   A.) there is only one buffer
   B.) there are n buffers ( n being greater than one but finite)
   C.) there are infinite buffers
   D.) the buffer size is bounded

Answer: Option 'B'

there are n buffers ( n being greater than one but finite)

  • 4. To ensure difficulties do not arise in the readers – writers problem, _______ are given exclusive access to the shared object.
   A.) readers
   B.) writers
   C.) readers and writers
   D.) none of these

Answer: Option 'B'

writers

  • 5. 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

Answer: Option 'A'

5 philosophers and 5 chopsticks

  • 6. 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

Answer: Option 'B'

does not necessarily eliminate the possibility of starvation

Classic Synchronization Problems - Operating System Questions and Answers Download Pdf