In this section of Operating System Process Synchronization.it contain Operating System Process Synchronization – Classic Problems of Synchronization MCQs (Multiple Choice Questions Answers).All the MCQs (Multiple Choice Question Answers) requires in detail reading of Operating System subject as the hardness level of MCQs have been kept to advance level.
PRACTICE IT NOW TO SHARPEN YOUR CONCEPT AND KNOWLEDGE
1. The bounded buffer problem is also known as :
- Producer – Consumer problem
- Readers – Writers problem
- Dining – Philosophers problem
- Dining – Readers problem
2. In bounded buffer problem Which of the following Assumption Stands TRUE:
- I. We assume that the pool consists of n buffers, each capable of holding one item.
- II. The mutex semaphore provides mutual exclusion for accesses to the buffer pool and is initialized to the value 1.
- III. The mutex semaphore provides mutual exclusion for accesses to the buffer pool and is initialized to the value 0.
- IV. The empty and full semaphores count the number of empty and full buffers.The semaphore empty is initialized to the value n; the semaphore full is initialized to the value 0.
- V. The empty and full semaphores count the number of empty and full buffers.The semaphore empty is initialized to the value 0; the semaphore full is initialized to the value n.
- 1,3,5
- 1,2,4
- 1,2,5
- 3,4,5
In problem, the producer and consumer processes share the following data structures:
int n;
semaphore mutex = 1;
semaphore empty = n;
semaphore full = 0
We assume that the pool consists of n buffers, each capable of holding one item.
The mutex semaphore provides mutual exclusion for accesses to the buffer pool and is initialized to the value 1. The empty and full semaphores count the number of empty and full buffers. The semaphore empty is initialized to the value n; the semaphore full is initialized to the value 0.
3. The readers–writers problem and its solutions have been generalized to provide reader–writer locks on some systems. When a process wishes only to read shared data, it requests the reader–writer lock in____
- Read MODE
- Read MODE
- Read and Write MODE
- All of the above
4. The readers–writers problem and its solutions have been generalized to provide reader–writer locks on some systems. A process wishing to modify the shared data must request the lock in____
- Read MODE
- Write MODE
- Read and Write MODE
- All of the above
5. Multiple processes are permitted to concurrently acquire a reader–writer lock in read mode, but only one process may acquire the lock for ___, as exclusive access is required for ____
- reading ,readers
- reading,writers
- Writing ,Writers
- None of the above
6. The Dining-Philosophers Problem Solution is:
- Deadlock free solution
- Starvation free solution
- page fault free solution
- All of the above
7. All processes share a semaphore variable mutex, which is initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward. Suppose that a process interchanges the order in which the wait() and signal() operations on the semaphore mutex are executed, resulting in the following execution: signal(mutex); ... critical section ... wait(mutex); In this situation
- a deadlock will occur
- processes will starve to enter critical section
- several processes maybe executing in their critical section
- all of the mentioned
8. All processes share a semaphore variable mutex, which is initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward. Suppose that a process replaces signal(mutex) with wait(mutex). That is, it executes wait(mutex); ... critical section ... wait(mutex); In this Case
- a deadlock will occur
- processes will starve to enter critical section
- several processes maybe executing in their critical section
- a deadlock will not occur
9. in the following execution: signal(mutex); ... critical section ... wait(mutex); Suppose that a process omits the wait(mutex), or the signal(mutex), or both. In this case:
- processes will starve to enter critical section
- several processes maybe executing in their critical section
- either mutual exclusion is violated or a deadlock will occur.
- processes will not starve to enter critical section
