OS Process Synchronization
In the bounded buffer problem, there are the empty and full semaphores that ____________
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
count the number of empty and full buffers
Related posts
In the bounded buffer problem ____________A. there is only one buffer
B. there are n buffers ( n being greater than one but finite)
C. there are infinite buffers
D. the buffer size is bounded
A minimum of _____ variable(s) is/are required to be shared between processes to solve the critical section problem.
A. one
B. two
C. three
D. four
The bounded buffer problem is also known as ____________
A. Readers โ Writers problem
B. Dining โ Philosophers problem
C. Producer โ Consumer problem
D. None of the mentioned
If the semaphore value is negative ____________
A. its magnitude is the number of processes waiting on that semaphore
B. it is invalid
C. no operation can be further performed on it until the signal operation is performed on it
D. none of the mentioned
The monitor construct ensures that ____________
A. only one process can be active at a time within the monitor
B. n number of processes can be active at a time within the monitor (n being greater than 1)
C. the queue has only one process in it at a time
D. all of the mentioned
A locking protocol is one that ____________
A. governs how locks are acquired
B. governs how locks are released
C. governs how locks are acquired and released
D. none of the mentioned
What are the two atomic operations permissible on semaphores?
A. wait
B. stop
C. hold
D. none of the mentioned
Leave a Reply