adplus-dvertising
frame-decoration

Question

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

Answer: (a).count the number of empty and full buffers

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

Q. In the bounded buffer problem :

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

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

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

Q. A monitor is a type of :

Q. A monitor is characterized by :

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

Q. The monitor construct ensures that :

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

Q. The process invoking the wait operation is :

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

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

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

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.

Q. Write ahead logging is a way :

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

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

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

Q. The system periodically performs checkpoints that consists of the following operation(s) :

Q. Consider a transaction T1 that committed prior to checkpoint. The <T1 commits> record appears in the log before the <checkpoint> record. Any modifications made by T1 must have been written to the stable storage either with the checkpoint or prior to it. Thus at recovery time: