GATE | CS | 2000 | Operating System | Concurrency & Synchronization | Question 21

Last Updated :
Discuss
Comments

Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be processes. Suppose each process P[i] executes the following: 

  wait (m[i]); wait(m[(i+1) mode 4]);

  ------

  release (m[i]); release (m[(i+1)mod 4]);

This could cause:

Thrashing

Deadlock

Starvation, but not deadlock

None of the above

This question is part of this quiz :

GATE-CS-2000,Deadlock,50 Operating System MCQs with Answers,Concurrency & Synchronization GATE CS PYQ Quiz
Tags:
GATE
Operating Systems Questions
Operating Systems
GATE CS
Share your thoughts in the comments