📝 Methods for Handling Deadlocks in Operating System (47 MCQs)

📖 From Operating System • 7. Deadlocks • 47 questions available

←Previous Topic:Necessary Conditions for Deadlock Characterization📝 Methods for Handling Deadlocks in Operating SystemMutual Exclusion Deadlock Prevention:Next Topic→

What is Methods for Handling Deadlocks in Operating System?

Definition:
Deadlock handling encompasses four strategies: Prevention, Avoidance, Detection and Recovery, and Ignorance (Ostrich Algorithm).

Example:
An OS may choose Prevention by denying Hold and Wait, or Detection by periodically running algorithm $A_{det}$ to find cycles and recover via termination.

Reason:
Different systems have varying requirements for performance and safety; selecting the appropriate method balances overhead against the risk of system failure.

Easy

Medium

Hard

📝 All Methods for Handling Deadlocks in Operating System MCQs

Q1. Which of the following is NOT one of the three general ways to deal with the deadlock problem?

A.Prevent or avoid deadlocks

B.Detect deadlocks and recover

C.Ignore the problem altogether

D.Automatically terminate all processes ✅

💡 Difficulty: easy | ✅ Correct: D

📖 Explanation: The text explicitly lists three approaches: prevention/avoidance, detection/recovery, and ignoring the problem. Automatically terminating all processes is not a general strategy; it could be part of recovery but is not one of the three overarching methods described.

Q2. What is the first approach to handling deadlocks mentioned in the text?

A.Use a protocol to prevent or avoid deadlocks ✅

B.Allow the system to enter a deadlocked state, detect it, and recover

C.Ignore the problem altogether

D.Combine all approaches for optimal results

💡 Difficulty: easy | ✅ Correct: A

📖 Explanation: The text lists the first method as using a protocol to prevent or avoid deadlocks, ensuring the system never enters a deadlocked state. This is presented as the primary proactive approach to deadlock management.

Q3. Which operating systems are cited in the text as using the approach of ignoring deadlocks?

A.Linux and Windows ✅

B.macOS and Unix

C.Android and iOS

D.FreeBSD and Solaris

💡 Difficulty: medium | ✅ Correct: A

📖 Explanation: The text explicitly mentions that most operating systems, including Linux and Windows, use the approach of ignoring the deadlock problem. This is a specific factual claim about the deadlock handling strategy of these widely used OSes.

Q4. When an operating system ignores deadlocks, who bears the responsibility for handling them?

A.The operating system developers

B.The hardware manufacturers

C.The application developers ✅

D.The system administrators

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: If the OS pretends deadlocks never occur, the responsibility falls on the application developer to write programs that can handle deadlocks. This is a critical point, as it shifts the burden of dealing with a complex system problem to the individual programmer.

Q5. According to the text, what is the primary rationale for ignoring deadlocks in many operating systems?

A.Deadlocks are impossible to prevent

B.Ignoring deadlocks is cheaper and deadlocks occur infrequently in many systems ✅

C.Detection algorithms are not reliable

D.Recovery is always automatic

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: The text cites expense as a key consideration. The other approaches are more complex and costly to implement. Since deadlocks are often rare (e.g., once per year), the cost of implementing prevention or avoidance may not be justified for many systems, making the 'ignore' approach economically attractive.

Q6. What is the fundamental goal of deadlock prevention?

A.To detect deadlocks as they occur

B.To ensure at least one of the necessary conditions cannot hold ✅

C.To recover from deadlocks automatically

D.To ignore deadlocks and let the system recover

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: Deadlock prevention focuses on breaking one of the four necessary conditions. By ensuring that at least one condition (like hold and wait or circular wait) cannot hold in the system, the system is guaranteed to never enter a deadlocked state.

Q7. Deadlock prevention works by constraining what aspect of a system?

A.How processes are scheduled

B.How resources are requested ✅

C.How memory is allocated

D.How files are accessed

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Prevention methods are protocols that constrain how requests for resources can be made. By controlling the manner in which processes ask for resources, the system can ensure that one of the deadlock conditions (like hold and wait) is never met.

Q8. Which deadlock condition does prevention typically target to ensure it cannot hold?

A.Mutual exclusion only

B.Hold and wait only

C.No preemption only

D.At least one of the necessary conditions ✅

💡 Difficulty: medium | ✅ Correct: D

📖 Explanation: Deadlock prevention aims to invalidate at least one of the four necessary conditions. It does not target a specific one in all cases; rather, the strategy is to break the chain by ensuring that one of these conditions can never be true in the system.

Q9. Why might deadlock prevention be considered a restrictive approach?

A.It requires the OS to terminate processes

B.It constrains how processes can request resources, potentially reducing concurrency ✅

C.It requires advance knowledge of all future requests

D.It is more expensive than ignoring deadlocks

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: Preventing hold and wait might require a process to request all resources at once, which can lower resource utilization. Preventing circular wait might require a fixed order of requests. These constraints can limit the flexibility of processes and reduce system performance, making it a restrictive approach.

Q10. What additional information does deadlock avoidance require that prevention does not?

A.The total number of processes

B.Information about future resource requests and releases ✅

C.The size of the resource-allocation graph

D.The priority of each process

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Avoidance requires advance knowledge of the resources a process will request and use during its lifetime. Prevention does not need this; it just enforces rules. This advance knowledge allows the OS to make safe decisions about whether to grant a request or make a process wait.

Q11. In deadlock avoidance, what must the operating system consider when deciding whether to grant a request?

A.Only the resources currently available

B.Only the resources currently allocated

C.Current resources, allocated resources, and future requests and releases ✅

D.Only the process's priority

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: The decision is complex and involves analyzing the system's state. The OS must know what is free, what is allocated, and what each process will need in the future. This complete picture is necessary to determine if granting a request could lead to a deadlock, making the system wait if it's unsafe.

Q12. Deadlock avoidance requires the system to know a process's 'future requests and releases.' Why is this knowledge important?

A.To schedule the process for maximum CPU time

B.To ensure the process does not exceed its memory limit

C.To verify that granting a request will keep the system in a safe state ✅

D.To calculate the process's priority

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: The knowledge is used for safety checking. The OS simulates the future to see if there is a way for all processes to complete. If granting a request could lead to a situation where no such sequence exists (an unsafe state), the request is delayed. This is the core of the avoidance algorithm.

Q13. If a system does not employ prevention or avoidance, what method must it use to handle deadlocks?

A.It must detect and recover from them ✅

B.It must ignore them

C.It must use a combined approach

D.It must terminate all processes periodically

💡 Difficulty: medium | ✅ Correct: A

📖 Explanation: When proactive measures are not used, the system must have a reactive plan. This involves an algorithm to detect when a deadlock has occurred and another to recover from it. This is the third of the three main approaches.

Q14. Deadlock detection requires an algorithm that examines the state of the system. What is the state being examined for?

A.To determine if a deadlock has occurred ✅

B.To predict future resource requests

C.To optimize resource allocation

D.To measure system performance

💡 Difficulty: easy | ✅ Correct: A

📖 Explanation: Detection is a diagnostic process. The system state is analyzed to see if a deadlock has indeed occurred. This is in contrast to avoidance, which tries to predict the future to prevent a deadlock from ever happening.

Q15. After detecting a deadlock, what is the next required step?

A.Prevention

B.Avoidance

C.Recovery ✅

D.Ignorance

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: Detection and recovery are two parts of a single approach. Once a deadlock is detected, the system must have a mechanism to recover from it, typically by breaking the cycle (e.g., terminating processes or preempting resources) to restore system functionality.

Q16. What happens if a system ignores deadlocks and has no detection or recovery mechanisms?

A.The system will eventually stop functioning and require a manual restart ✅

B.The deadlock will automatically resolve itself

C.The system will ignore the problem and continue functioning normally

D.The system will restart itself automatically

💡 Difficulty: medium | ✅ Correct: A

📖 Explanation: The text is clear: without detection, the deadlock remains undetected. Resources are tied up, performance deteriorates, and more processes get stuck. Eventually, the system will stop functioning (a system-wide freeze) and will need to be restarted manually.

Q17. The text states that a system with an undetected deadlock will see its 'performance deteriorate.' Why does this happen?

A.Because the CPU runs faster

B.Because resources are being held by processes that cannot run, and more processes get stuck ✅

C.Because the memory is freed

D.Because the scheduler becomes more efficient

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Performance degrades due to the compounding effect of the deadlock. The processes in the deadlock hold resources but make no progress. New or other processes that need these resources also become blocked. This creates a cascade of blocked processes, reducing the system's throughput and responsiveness.

Q18. In the context of ignoring deadlocks, what does the text suggest about the frequency of deadlocks in many systems?

A.They occur very frequently

B.They occur infrequently, perhaps once per year ✅

C.They never occur

D.They occur every few minutes

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: A key argument for ignoring deadlocks is that in many systems, they are rare. The text uses the example of 'once per year' to illustrate that the cost of implementing prevention or avoidance might not be worth it for the occasional deadlock.

Q19. Besides cost, what other reason is given for why systems might ignore deadlocks?

A.Prevention algorithms are too simple

B.Avoidance algorithms are always accurate

C.Methods used to recover from other conditions can be used for deadlock recovery ✅

D.Deadlocks are not a real problem

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: The text suggests that techniques for dealing with other system failures (like a frozen state) can be repurposed for deadlock recovery. This provides a practical safety net, even if deadlocks are officially ignored, making the approach more viable.

Q20. What is the distinction made between a deadlock and a 'frozen state'?

A.A frozen state is a type of deadlock

B.A frozen state is not a deadlock and can be caused by a process not returning control ✅

C.A frozen state is easier to recover from

D.A frozen state is less severe than a deadlock

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: The text clarifies that a system can be frozen (unresponsive) without being in a deadlock. For example, a real-time process with the highest priority might run in a loop and never return control to the OS, freezing the system. This is a different kind of failure, but the manual recovery methods for it (like a restart) can also be used for deadlock recovery.

Q21. The text mentions that basic approaches can be combined. What is the motivation for combining them?

A.It simplifies the OS design

B.It allows selecting an optimal approach for each class of resources ✅

C.It is required by all operating systems

D.It eliminates the need for recovery algorithms

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: The text states that none of the basic approaches alone is appropriate for the entire spectrum of problems. By combining them, an OS can use prevention for some resources (where it's efficient), avoidance for others (where information is available), and detection for others, optimizing the overall deadlock management strategy.

Q22. What is an example of a scenario that is not a deadlock but can cause a system to freeze, as mentioned in the text?

A.A process holding a mutex and waiting for another

B.A circular wait among processes

C.A real-time process running at the highest priority and never returning control ✅

D.A process requesting a resource that is not available

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: This is the 'frozen state' example. A real-time process with the highest priority can monopolize the CPU. If it enters an infinite loop and never gives up control, the system becomes unresponsive. This is not a deadlock (no circular wait for resources) but requires similar manual intervention.

Q23. The text says that deadlock prevention ensures the system 'will never enter a deadlocked state.' How is this guarantee typically achieved?

A.By allowing unlimited resources

B.By breaking at least one of the necessary conditions ✅

C.By granting all requests immediately

D.By using a single resource type

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: The guarantee is achieved by designing the system so that one of the four Coffman conditions can never hold. For example, if hold and wait is impossible, then a deadlock (which requires hold and wait) cannot occur. This is the fundamental principle behind prevention protocols.

Q24. In the context of deadlock detection, what is the role of the algorithm?

A.To prevent deadlocks from occurring

B.To decide if a deadlock has occurred by examining the system state ✅

C.To ignore deadlocks

D.To preempt resources

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: The detection algorithm is diagnostic. It inspects the system state, often using the resource-allocation graph, to determine if a cycle exists that indicates a deadlock. It does not prevent or fix the deadlock; it simply reports its existence.

Q25. According to the text, what is the typical cost-benefit analysis for ignoring deadlocks?

A.It is more expensive but more effective

B.It is cheaper and deadlocks are rare, making it worthwhile ✅

C.It is cheaper but deadlocks are common, making it ineffective

D.It is equally expensive as other methods

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: The text explicitly weighs the cost against the benefit. The approaches are expensive, and since deadlocks are rare in many systems, the benefit of implementing them is low. Therefore, the cheaper approach of ignoring them is often chosen, as the cost of occasional manual recovery is less than the cost of complex prevention or avoidance.

Q26. A system uses deadlock avoidance. What is the key information it must have about each process to make safe decisions?

A.The process's priority

B.The process's total execution time

C.The exact sequence of resources the process will request and release ✅

D.The process's memory footprint

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: Avoidance requires precise knowledge of the future. The system must know, for each process, the order and types of resources it will request and release. This is the 'additional information in advance' that the text describes, which is necessary to determine if the system will remain in a safe state after granting a request.

Q27. If a system uses deadlock detection and recovery, which phase occurs first?

A.Recovery

B.Detection ✅

C.Prevention

D.Avoidance

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: In this approach, the system allows deadlocks to happen. The first step is to run a detection algorithm to identify if a deadlock has occurred. Only after a deadlock is detected does the system initiate the recovery phase to break it.

Q28. What is a potential consequence of ignoring deadlocks, as described in the text?

A.The system will automatically fix itself

B.The system will stop functioning and need a manual restart ✅

C.The deadlock will be ignored and the system will run faster

D.The system will detect the deadlock and recover on its own

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: The text paints a grim picture: ignoring deadlocks leads to a cascade of blocked processes, deteriorating performance, and eventually a complete system freeze. Since there is no detection or recovery, manual restart by an operator is the only solution.

Q29. The text states that in many systems, deadlocks occur infrequently. What is the primary factor that determines whether the 'ignore' approach is acceptable?

A.The cost of the other methods versus the cost of the infrequent deadlocks ✅

B.The number of users on the system

C.The speed of the CPU

D.The amount of memory in the system

💡 Difficulty: hard | ✅ Correct: A

📖 Explanation: The decision is an economic one. If the cost (in terms of performance, complexity, and development time) of implementing prevention or avoidance is high, and deadlocks are rare, then the cost of the occasional manual restart is lower. Therefore, ignoring deadlocks becomes the economically rational choice.

Q30. Which of the following is an example of a method to recover from deadlocks, even if the system officially ignores them?

A.Using a resource-allocation graph

B.Terminating one of the processes in the cycle ✅

C.Requesting all resources at once

D.Ensuring a global lock order

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Terminating a process is a classic recovery technique. Even if an OS doesn't have an official deadlock detection algorithm, an administrator can observe a frozen system, guess that a deadlock has occurred, and manually kill a process to free up resources and restore operation. This is a crude but effective recovery.

Q31. What is the main difference between deadlock prevention and deadlock avoidance?

A.Prevention assumes deadlocks will happen; avoidance assumes they won't

B.Prevention ensures deadlocks never happen; avoidance ensures they are handled if they do

C.Prevention breaks conditions without knowing the future; avoidance uses knowledge of future requests to make decisions ✅

D.Prevention is used only for single-instance systems; avoidance is used for multiple-instance systems

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: Prevention is a proactive set of rules (e.g., 'always request in this order') that works regardless of the future. Avoidance is reactive in the sense that it makes a decision for each request based on the current state and knowledge of future requests to ensure the system never reaches an unsafe state.

Q32. The text mentions that some researchers argue none of the basic approaches is appropriate for all resource types. What does this suggest about real-world operating systems?

A.They should use only one approach

B.They should ignore deadlocks entirely

C.They should use a hybrid approach, applying different strategies to different resources ✅

D.They should not worry about deadlocks

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: This statement suggests that a one-size-fits-all solution is not optimal. The best strategy for managing memory might be different from the best strategy for managing I/O devices. A real-world OS might implement prevention for one class of resources (to ensure predictability) and detection for another (where prevention is too costly).

Q33. If an OS uses the third solution (ignoring deadlocks), what is the role of the resource-allocation graph in the system?

A.It is used to prevent deadlocks

B.It is used to detect deadlocks automatically

C.It is not used, as the OS does not analyze for deadlocks ✅

D.It is used to allocate resources

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: The resource-allocation graph is a tool for analyzing deadlocks. If the OS officially ignores deadlocks, it would not typically maintain or analyze this graph for the purpose of detection. While it might be used conceptually, the OS would not act on the information to prevent or recover from deadlocks.

Q34. What is the relationship between the 'frozen state' caused by a non-returning real-time process and the deadlock state?

A.They are the same thing

B.They are both caused by resource circular waits

C.They are distinct, but both may require manual recovery ✅

D.A frozen state is a subset of deadlock states

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: The text distinguishes them. A deadlock involves a circular wait for resources. A frozen state due to a real-time process involves a process hogging the CPU and not returning control. They are different phenomena, but the practical outcome (system unresponsiveness) and the recovery method (manual restart) are similar.

Q35. The text says that the 'third solution' is used by most operating systems. What does this say about the reliability of these systems?

A.They are guaranteed to never have deadlocks

B.They can experience deadlocks, but they are designed to handle them in other ways

C.They are vulnerable to deadlocks and rely on the administrator or application to handle them ✅

D.They are immune to all system failures

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: It implies that these systems are technically vulnerable to deadlocks. They do not have built-in prevention or automatic recovery. They rely on the application programmer to write deadlock-free code and the system administrator to manually intervene when a deadlock-freezes the system.

Q36. What is a key challenge of deadlock avoidance that makes it difficult to implement in practice?

A.It is computationally expensive to analyze the system state

B.It requires knowledge of future requests, which is often not available ✅

C.It is easy to implement

D.It requires the system to have unlimited resources

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: The major practical challenge is the need to know future resource requests. In many systems, this information is not known in advance. It may depend on user input or other unpredictable factors. Without this information, the avoidance algorithm cannot function, limiting its applicability.

Q37. If a system ignores deadlocks, what is the most likely outcome for a process that is in a deadlock?

A.It will be automatically terminated

B.It will be recovered

C.It will remain blocked forever until the system is restarted ✅

D.It will eventually be allocated resources

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: Without detection or recovery, a deadlocked process has no way to proceed. It will remain blocked, waiting for resources that will never be released. The resources it holds are also permanently tied up, contributing to the system freeze. A manual restart is the only way to clear these processes.

Q38. What is the fundamental difference between a system that uses prevention and one that uses avoidance?

A.Prevention is reactive; avoidance is proactive

B.Prevention breaks conditions; avoidance makes decisions based on future knowledge to avoid unsafe states ✅

C.Prevention is more complex than avoidance

D.Prevention requires human intervention; avoidance does not

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: Prevention is a static set of rules that eliminates a condition. Avoidance is a dynamic algorithm that evaluates each request in the context of the current state and predicted future. Prevention is a 'design-time' solution, while avoidance is a 'run-time' decision-making process.

Q39. In deadlock avoidance, what does it mean for the system to be in a 'safe state'?

A.A state where no deadlock has occurred

B.A state where there is a sequence of allocations that allows all processes to complete ✅

C.A state where resources are allocated efficiently

D.A state where processes are not waiting for resources

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: This is the core concept of avoidance. A safe state is one from which there is a guaranteed way for all processes to finish without deadlocking. The system must ensure it only transitions from one safe state to another. If granting a request would lead to an unsafe state (where a deadlock is possible), the request is delayed.

Q40. The text mentions that 'expense' is an important consideration when choosing a deadlock handling method. What kind of expense is primarily being referred to?

A.The cost of hardware

B.The cost of software development and system performance overhead ✅

C.The cost of electricity

D.The cost of hiring administrators

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: The expense refers to the complexity and overhead of implementing prevention or avoidance. These methods can be complex to code, and they can also reduce system performance (e.g., by forcing processes to request resources inefficiently). The cost of developing and running these complex systems is higher than simply ignoring the problem.

Q41. Which approach to deadlock handling is most dependent on the application developer's skill?

A.Prevention

B.Avoidance

C.Detection and Recovery

D.Ignoring the problem ✅

💡 Difficulty: medium | ✅ Correct: D

📖 Explanation: When the OS ignores deadlocks, the entire burden falls on the developer. They must design their application's locking and resource management logic to avoid creating deadlocks. In the other approaches, the OS provides some level of support or guarantee, reducing the developer's responsibility.

Q42. In the context of deadlock handling, what does the term 'protocol' refer to in the phrase 'use a protocol to prevent or avoid deadlocks'?

A.A network communication standard

B.A set of rules or conventions for resource requests ✅

C.A type of software program

D.A hardware specification

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: A protocol here is a set of rules that processes must follow. For prevention, this might be a rule like 'request all resources at once.' For avoidance, it is the algorithm used by the OS to decide on requests. It is a defined procedure for managing resource allocation.

Q43. If a system is in a deadlocked state but has no detection algorithm, what will happen when a new process requests a resource held by a deadlocked process?

A.The new process will be granted the resource

B.The new process will also enter a deadlocked state (or be blocked) ✅

C.The new process will be terminated

D.The deadlock will be resolved

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: The new process's request cannot be granted because the resource is held. It will be placed in a waiting state. If the deadlock is not detected, the new process will wait indefinitely, effectively joining the deadlocked set and worsening the situation. This is how a deadlock can spread.

Q44. Which approach to deadlock handling is often described as the 'ostrich algorithm'?

A.Deadlock Prevention

B.Deadlock Avoidance

C.Deadlock Detection and Recovery

D.Ignoring the Problem ✅

💡 Difficulty: hard | ✅ Correct: D

📖 Explanation: The 'ostrich algorithm' is a term of art for ignoring a problem, based on the myth that ostriches bury their heads in the sand. In the context of deadlocks, this refers to the approach where the system simply pretends deadlocks will never occur, which is the third method described in the text.

Q45. What is the relationship between deadlock prevention and the necessary conditions?

A.Prevention ensures all four conditions are present

B.Prevention ensures at least one condition cannot hold ✅

C.Prevention is independent of the conditions

D.Prevention only addresses mutual exclusion

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: Prevention works by breaking the chain. It focuses on ensuring that one of the four necessary conditions is impossible. This guarantee is sufficient to make deadlocks impossible, as all four conditions are required for a deadlock to occur.

Q46. If a system is designed to allow deadlocks but has a recovery mechanism, what must the recovery mechanism be able to do?

A.Prevent future deadlocks

B.Terminate processes or preempt resources to break the cycle ✅

C.Ignore the deadlock

D.Restart the system automatically

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Recovery must break the deadlock cycle. Common methods include terminating one or more of the deadlocked processes or preempting resources from them. This action frees up the tied resources, allowing the remaining processes to proceed and breaking the circular wait.

Q47. The text suggests that manual recovery methods for 'frozen states' can be used for deadlock recovery. This indicates that:

A.Deadlocks and frozen states are identical

B.The practical response (like a restart) may be the same for different types of system failures ✅

C.Frozen states are more common than deadlocks

D.Manual recovery is always preferred

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: This indicates a pragmatic approach. Even if a system doesn't have a sophisticated deadlock recovery algorithm, the system administrator can observe that the system is unresponsive (whether due to a deadlock or a process hogging the CPU) and apply a standard solution like restarting the system or killing unresponsive processes.

🔗 Related Topics (MCQs)

📝 Deadlocks Introduction in Operating System MCQs 📝 Deadlocks System Model in Operating System MCQs 📝 Deadlock Characterization in Operating System MCQs 📝 Necessary Conditions for Deadlock Characterization MCQs 📝 Mutual Exclusion Deadlock Prevention MCQs

←Previous Topic:Necessary Conditions for Deadlock Characterization📝 Methods for Handling Deadlocks in Operating SystemMutual Exclusion Deadlock Prevention:Next Topic→