Operating system mcqs classic sync problems

YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

CLICK HERE TO DOWNLOAD

Operating system mcqs classic sync problems

Question 6 [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. signal(mutex); ..... critical section ..... wait(mutex); In this situation :
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
Question 7 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
Question 8 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
Question 9 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
There are 9 questions to complete.