Operating System MCQ and Answers – Classic Synchronization Problems

These Operating System MCQ and Answers – Classic Synchronization Problems are asked in various examinations including BCA, MCA, GATE, and other tests. The questions based on the below Operating System MCQ and Answers – Classic Synchronization Problems test your basic knowledge of MCQs on the topic of Operating Systems and the level of comprehension and grasp that you hold.

Operating System MCQ and Answers – Classic Synchronization Problems

1. 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 the mentioned

Answer: b

2. 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: a

3. 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 the mentioned

Answer: b

4. The bounded buffer problem is also known as ____________

a) Readers – Writers problem

b) Dining – Philosophers problem

c) Producer – Consumer problem

d) None of the mentioned

Answer: c

5. 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 the mentioned

Answer: a

6. 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: b

Comments