Classic Sync Problems — Test 1
Page 1 of 1
Question 1
The bounded buffer problem is also known as ____________
0
System Administrator 2026
Question 2
In the bounded buffer problem, there are the empty and full semaphores that ____________
0
System Administrator 2026
Question 3
In the bounded buffer problem ____________
0
System Administrator 2026
Question 4
To ensure difficulties do not arise in the readers – writers problem _______ are given exclusive access to the shared object.
0
System Administrator 2026
Question 5
The dining – philosophers problem will occur in case of ____________
0
System Administrator 2026
Question 6
A deadlock free solution to the dining philosophers problem ____________
0
System Administrator 2026
Question 7
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. advertisement signal(mutex); ..... critical section ..... wait(mutex); In this situation :
0
System Administrator 2026
Question 8
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);
0
System Administrator 2026
Question 9
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?
0
System Administrator 2026