Multiple Choice
Which of the following statements is true?
A) A counting semaphore can never be used as a binary semaphore.
B) A binary semaphore can never be used as a counting semaphore.
C) Spinlocks can be used to prevent busy waiting in the implementation of semaphore.
D) Counting semaphores can be used to control access to a resource with a finite number of instances.
Correct Answer:
Verified
Correct Answer:
Verified
Q16: Explain what a deadlock is.
Q17: Mutex lock variable is binary.
Q18: Bounded waiting implies progress, and progress implies
Q19: Write two short methods that implement the
Q20: Explain what critical section problem is.
Q22: Mutex locks and counting semaphores are essentially
Q23: Assume you had a function named update()
Q24: Which of the following is not true
Q25: Which of the following is not true
Q26: Explain what race condition is.