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
I have been asked this question in my homework.
This interesting question is from Classic Synchronization Problems in chapter Process Synchronization of Operating System