Operating System · Deadlock · 2 marks · Multiple choice
Which policies prevent deadlock with mutually exclusive resources? I: Acquire all resources at the beginning; if any are unavailable, release all acquired resources. II: Number resources uniquely and request only in increasing order. III: Number resources uniquely and request only in decreasing order. IV: Request a resource only if its number is larger than every currently held resource.
I removes hold-and-wait by requiring all-or-release acquisition. II and IV impose a strict increasing order; III imposes a strict decreasing order. Either consistent total ordering prevents circular wait. Therefore each policy can prevent deadlock, D.
More Deadlock questions
GATE 2021 CS (CS2) Q53– There is one instance of each resource type. Under a global lock L, OwnResource(R)…
GATE 2026 CS (CS1) Q29– With respect to deadlocks in an operating system, which of the following statements is/are…
GATE 2026 CS (CS1) Q35– Consider a system consisting of k instances of a resource R, being shared by 5 processes.…
GATE 2025 CS (CS2) Q48– P = \P 1, P 2, P 3, P 4\ consists of all active processes in an operating system. R = \R…
GATE 2022 CS Q26– Which of the following statements is/are TRUE with respect to deadlocks?
GATE 2019 CS Q49– Consider the following snapshot of a system running n concurrent processes. Process i is…