# Operating system mcqs classic sync problems

## Operating system mcqs classic sync problems

 Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
 Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
 Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
 Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned. (GATE 2010) Method used by P1 : while(S1==S2); Critical section S1 = S2; Method used by P2 : while(S1!=S2); Critical section S2 = not(S1); Which of the following statements describes properties achieved?
 A Mutual exclusion but not progress B Progress but not mutual exclusion C Neither mutual exclusion nor progress D Both mutual exclusion and progress
 Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
All processes share a semaphore variable mutex, initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward. Suppose a process executes in the following manner. wait(mutex); ..... critical section ..... wait(mutex);
 A a deadlock will occur B processes will starve to enter critical section C several processes maybe executing in their critical section D all of the mentioned
There are 5 questions to complete.