ISRO2020-22

Question

Raymonds tree based algorithm ensures

• A. no starvation, but deadlock may occur in rare cases
• B. no deadlock, but starvation may occur
• C. neither deadlock nor starvation can occur
• D. deadlock may occur in cases where the process is already starved

Answer 1

$\underline{\textbf{Answer:}\Rightarrow}\;\mathbf{b.}$

$\underline{\textbf{Explanation:}\Rightarrow}$

Raymond’s algorithm makes use of the greedy strategy which may cause starvation but deadlock is impossible.

---

https://www.geeksforgeeks.org/raymonds-tree-based-algorithm/