Q. What will happen if a non-recursive mutex is locked more than once ?

View solution

Q. A semaphore :

View solution

Q. The two kinds of semaphores are :

View solution

Q. A mutex :

View solution

Q. At a particular time of computation the value of a counting semaphore is 7.Then 20 P operations and 15 V operations were completed on this semaphore.The resulting value of the semaphore is :

View solution

Q. A binary semaphore is a semaphore with integer values :

View solution

Q. Semaphores are mostly used to implement :

View solution

Q. Spinlocks are intended to provide __________ only.

View solution

Q. The bounded buffer problem is also known as :

View solution

Q. In the bounded buffer problem, there are the empty and full semaphores that :

View solution

Q. In the bounded buffer problem :

View solution

Q. To ensure difficulties do not arise in the readers – writers problem, _______ are given exclusive access to the shared object.

View solution

Q. The dining – philosophers problem will occur in case of :

View solution

Q. A deadlock free solution to the dining philosophers problem :

View solution

Q. A monitor is a type of :

View solution

Q. A monitor is characterized by :

View solution

Q. A procedure defined within a ________ can access only those variables declared locally within the _______ and its formal parameters.

View solution

Q. The monitor construct ensures that :

View solution

Q. The operations that can be invoked on a condition variable are :

View solution

Q. The process invoking the wait operation is :

View solution