Operating System-Deadlock (GATE Computer Science): Questions 8 - 8 of 8
Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 913 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. View Sample Explanation or View Features.
Rs. 450.00 or
Question number: 8
» Operating System » Deadlock
Deadlocks can be described more precisely in terms of a directed graph called a ________
System resource-allocation graph.
system reallocation-allocation graph.
System resource-algorithm graph.
|d.||None of the above|