OS Process Synchronization

wait

stop

hold

none of the mentioned

governs how locks are acquired

governs how locks are released

governs how locks are acquired and released

none of the mentioned

only one process can be active at a time within the monitor

n number of processes can be active at a time within the monitor (n being greater than 1)

the queue has only one process in it at a time

all of the mentioned

its magnitude is the number of processes waiting on that semaphore

it is invalid

no operation can be further performed on it until the signal operation is performed on it

none of the mentioned

Readers – Writers problem

Dining – Philosophers problem

Producer – Consumer problem

None of the mentioned

count the number of empty and full buffers

count the number of empty and full memory spaces

count the number of empty and full queues

none of the mentioned

one

two

three

four

there is only one buffer

there are n buffers ( n being greater than one but finite)

there are infinite buffers

the buffer size is bounded