1 votes 1 votes Raymonds tree based algorithm ensures no starvation, but deadlock may occur in rare cases no deadlock, but starvation may occur neither deadlock nor starvation can occur deadlock may occur in cases where the process is already starved Databases isro-2020 databases transaction-and-concurrency normal + – Satbir asked Jan 13, 2020 • retagged Dec 4, 2022 by Lakshman Bhaiya Satbir 1.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes $\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/ `JEET answered Jan 13, 2020 • edited Jan 13, 2020 by `JEET `JEET comment Share Follow See all 0 reply Please log in or register to add a comment.