Question 2543 – OOPS
November 29, 2023Question 6988 – UGC-NET June CS 2019 Paper 1
November 29, 2023Question 8879 – Operating-Systems
Raymond’s tree based algorithm ensures
Correct Answer: B
Question 800 Explanation:
This algorithm creates a tree data structure and hence avoids a cycle. Therefore, deadlock is not possible. A site can enter the critical section on receiving the token even when its request is not on the top of the request queue. Hence, starvation is possible.
No starvation, but deadlock may occur in rare clases
No deadlock but starvation may occur
Neither deadlock nor starvation can occur
Deadlock may occur in cases where the process is already starved
Subscribe
Login
0 Comments