Multiple Choice
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
Correct Answer:
Verified
Correct Answer:
Verified
Q15: A deadlock free solution to the dining
Q16: What is a semaphore?<br>A)is a binary mutex<br>B)must
Q17: What is the main disadvantage of spinlocks?<br>A)they
Q18: What are Spinlocks?<br>A)cpu cycles wasting locks over
Q19: A monitor is characterized by<br>A)a set of
Q20: The bounded buffer problem is also known
Q21: A collection of instructions that performs a
Q23: Semaphore is a/an_to solve the critical section
Q24: What are the operations that can be
Q25: A monitor is a type of_<br>A)semaphore<br>B)low level