GATE | GATE-CS-2000 | Question 49
Let m…m be mutexes (binary semaphores) and P …. P 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:
(C) Starvation, but not deadlock
(D) None of the above
Explanation: See question 2 of https://www.geeksforgeeks.org/operating-systems-set-1/
Quiz of this Question
Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.
Learn all GATE CS concepts with Free Live Classes on our youtube channel.