Question: Select the correct statements regarding mutex lock to prevent race condition.</br> I. a process must acquire the lock before entering a critical section;</br> II. a process need not acquire the lock before entering a critical section;</br> III. it releases the lock when it exits the critical section</br> IV. a process must acquire the lock when it exits the critical section.</br>
Answer:
MCQ: Select the correct statements regarding mutex lock to prevent race condition.</br> I. a process must acquire the lock before entering a critical section;</br> II. a process need not acquire the lock before entering a critical section;</br> III. it releases the lock when it exits the critical section</br> IV. a process must acquire the lock when it exits the critical section.</br>
Correct Answer:
A. 1 and 3
Discuss a Question
Related Questions
- 1. The main disadvantage of the Mutex Lock is
- 2. In Spinlocks :
- 3. A semaphore S is an integer variable that, apart from initialization, is accessed only through two standard atomic operations:
- 4. where two or more processes are waiting indefinitely for an event that can be caused only by one of the waiting processes is called.
- 5. Indefinite blocking may occur if we remove processes from the list associated with a semaphore in ________ order.
- 6. indefinite blocking or starvation is problem related to ___
- 7. In Priority Inversion Which of following Stands TRUE:
- 8. The bounded buffer problem is also known as :
- 9. In bounded buffer problem Which of the following Assumption Stands TRUE: <ol> <li>I. We assume that the pool consists of n buffers, each capable of holding one item.</li> <li>II. The mutex semaphore provides mutual exclusion for accesses to the buffer pool and is initialized to the value 1.</li> <li>III. The mutex semaphore provides mutual exclusion for accesses to the buffer pool and is initialized to the value 0.</li> <li>IV. The empty and full semaphores count the number of empty and full buffers.The semaphore empty is initialized to the value n; the semaphore full is initialized to the value 0.</li> <li>V. The empty and full semaphores count the number of empty and full buffers.The semaphore empty is initialized to the value 0; the semaphore full is initialized to the value n.</li> </ol>
- 10. The readers–writers problem and its solutions have been generalized to provide reader–writer locks on some systems. When a process wishes only to read shared data, it requests the reader–writer lock in____
You may be interested in:
OS Process Synchronization MCQsRecently Added Articles
Top 5 Kahoot Winner Strategies Students Are Using Right Now
Last updated on: May 14, 2025Posted by: ExamRadar
Daily Routine to Cover the RBI Grade B Syllabus Fast
Last updated on: May 14, 2025Posted by: ExamRadar
How Can AI Simplify the Academic Life of Students?
Last updated on: April 16, 2025Posted by: ExamRadar
Want to Clear IBPS RRB PO? Master These Mock Test Hacks!
Last updated on: March 10, 2025Posted by: ExamRadar
Top AI Tools for Instantly Detecting Plagiarized Writing
Last updated on: December 5, 2024Posted by: ExamRadar
Applying Algorithmic Trading Techniques to Forex: Insights for Programmers and Data Scientists
Last updated on: November 22, 2024Posted by: ExamRadar
Image to Text Conversion Made Easy: Online Tool Insights
Last updated on: April 12, 2024Posted by: ExamRadar