Multiple Choice
A deadlock free solution to the dining philosophers problem___________
A) necessarily eliminates the possibility of starvation
B) does not necessarily eliminate the possibility of starvation
C) eliminates any possibility of any kind of problem further
D) none of the mentioned
Correct Answer:
Verified
Correct Answer:
Verified
Q10: What will happen if a non-recursive mutex
Q11: The dining - philosophers problem will occur
Q12: What are the two kinds of semaphores?<br>A)mutex
Q13: The signal operation of the semaphore basically
Q14: The code that changes the value of
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