Computer Science · Operating Systems
Let m[0]...m[4] be mutexes (binary semaphores) and P[0]...P[4] be processes. Suppose each process P[i] executes: wait(m[i]); wait(m[(i + 1) mod 4]); ... release(m[i]); release(m[(i + 1) mod 4]); This concurrent execution could cause:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Neither thrashing nor deadlock
- 2Starvation, but not deadlock
- 3Deadlock✓
- 4Thrashing
Correct answer
Deadlock
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Operating Systems MCQs →Want more practice questions on Operating Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Operating Systems