Bird
Raised Fist0

In a system where resources are reusable and processes can request multiple instances of the same resource type, which deadlock prevention strategy is most effective to avoid circular wait without severely limiting concurrency?

hard⚖️ Approach Comparison Q8 of Q15
Operating Systems - Deadlock - Four Necessary Conditions (Coffman)
In a system where resources are reusable and processes can request multiple instances of the same resource type, which deadlock prevention strategy is most effective to avoid circular wait without severely limiting concurrency?
AAllow preemption of resources held by processes
BEliminate mutual exclusion by making all resources sharable
CForce processes to request all resources at once
DEnforce strict global ordering of resource acquisition
Step-by-Step Solution
Solution:

  1. Step 1: Understand the scenario

    Multiple instances per resource type and reusable resources require careful deadlock prevention.

  2. Step 2: Evaluate strategies

    Strict global ordering prevents circular wait without forcing all-at-once requests, preserving concurrency. Preemption is complex and may not be feasible. Forcing all resources at once reduces concurrency. Eliminating mutual exclusion is impossible for non-sharable resources.

  3. Final Answer:

    Option D -> Option D

  4. Quick Check:

    Ordering prevents circular wait with concurrency [OK]
Quick Trick: Ordering prevents circular wait with less concurrency loss [OK]
Common Mistakes:
MISTAKES
  • Choosing preemption without feasibility
  • Forcing all resources reduces concurrency too much
Trap Explanation:
PITFALL
  • Candidates often pick preemption or all-at-once requests ignoring concurrency impact.
Interviewer Note:
CONTEXT
  • Tests nuanced application of deadlock prevention in complex resource scenarios.
Master "Deadlock - Four Necessary Conditions (Coffman)" in Operating Systems

2 interactive learning modes - each teaches the same concept differently

SolutionTrace

Want More Practice?

15+ quiz questions · All difficulty levels · Free

Free Signup - Practice All Questions
More Operating Systems Quizzes
Disk Scheduling - SSTF, SCAN, C-SCAN - Disk Scheduling - SSTF, SCAN, C-SCAN - Quiz 5medium File Allocation Methods - Contiguous, Linked, Indexed - File Allocation Methods - Contiguous, Linked, Indexed - Quiz 13medium Internal vs External Fragmentation - Compaction & Buddy System - Internal vs External Fragmentation - Compaction & Buddy System - Quiz 6medium Process State Machine - Five-State Model - Process State Machine - Five-State Model - Quiz 7medium Process vs Thread - Key Differences - Process vs Thread - Key Differences - Quiz 11easy Process vs Thread - Key Differences - Process vs Thread - Key Differences - Quiz 7medium Process vs Thread - Key Differences - Process vs Thread - Key Differences - Quiz 9hard Producer-Consumer Problem Using Semaphores - Producer-Consumer Problem Using Semaphores - Quiz 2easy Producer-Consumer Problem Using Semaphores - Producer-Consumer Problem Using Semaphores - Quiz 5medium TLB - Translation Lookaside Buffer & Effective Access Time - TLB - Translation Lookaside Buffer & Effective Access Time - Quiz 15hard