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

Q. If no process is suspended, the signal operation :

View solution

Q. A collection of instructions that performs a single logical function is called :

View solution

Q. A terminated transaction that has completed its execution successfully is ____________ otherwise it is __________

View solution

Q. The state of the data accessed by an aborted transaction must be restored to what it was just before the transaction started executing. This restoration is known as ________ of transaction.

View solution

Q. Write ahead logging is a way :

View solution

Q. In the write ahead logging a _____ is maintained.

View solution

Q. An actual update is not allowed to a data item :

View solution

Q. The undo and redo operations must be _________ to guarantee correct behaviour, even if a failure occurs during recovery process.

View solution