OOPS
November 29, 2023
UGC-NET June CS 2019 Paper 1
November 29, 2023
OOPS
November 29, 2023
UGC-NET June CS 2019 Paper 1
November 29, 2023

ISRO CS 2020

Question 10
Raymond’s tree based algorithm ensures
A
No starvation, but deadlock may occur in rare clases
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
Question 10 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.
Correct Answer: B
Question 10 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.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x