Multiple Choice
In the solution for bounded buffer problem using JAVA monitors (Figure 7.9) , functions insert( ) and remove( ) are synchronized to ensure that
A) a thread may insert an item and different thread may remove an item from a different location in the buffer simultaneously.
B) at most one thread may enter or remove an item at any time.
C) at most one thread may enter an item at any time, but multiple threads may remove items from different locations at the same time.
D) multiple thread may enter items at different locations at the same time, but at most one thread may remove an item at the same time.
Correct Answer:

Verified
Correct Answer:
Verified
Q45: Emergence of multicore systems has put greater
Q46: JAVA provides support for both named and
Q47: A difference between software transactional memory (STM)
Q48: Explain the key limitation of wait( )
Q49: Describe a scenario when using a reader-writer
Q51: Explain how can a POSIX unnamed semaphore
Q52: Transactional memory may particularly be useful for
Q53: A reader-writer lock gives preference to writer
Q54: Atomic integers in Linux are useful when<br>A)
Q55: A call to pthread_cond_signal() (used by POSIX