860 views

Raymonds tree based algorithm ensures

1. no starvation, but deadlock may occur in rare cases
2. no deadlock, but starvation may occur
3. neither deadlock nor starvation can occur
4. deadlock may occur in cases where the process is already starved

$\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/

by