QuizzesDeadlock Detection & Recovery — Concept Check
advanced
operating-systems

Deadlock Detection & Recovery — Concept Check

Questions on Deadlock Detection & Recovery. Deadlock detection algorithms identify when deadlock has occurred, and recovery strategies break the deadlock by terminating processes or preempting resources.

8 minutes 8 questions Pass at 70%
Time Limit
8 minutes - timer starts when you begin
Change Answers Freely
Revisit and change any answer before submitting
Full Review After Submit
Correct answers and explanations shown for every question
Auto-submit on timeout
Quiz submits automatically when time runs out

Questions in this quiz

8 questions on Deadlock Detection & Recovery — Concept Check. Work through them here, then start the quiz to answer them and see your score.

  1. 1.A system is experiencing a deadlock where processes A, B, and C are involved. You decide to terminate one process to break the cycle. Which criterion is NOT typically used for selecting a victim?

    • ANumber of times preempted
    • BAmount of resources held
    • CProcess priority
    • DProcess ID number
  2. 2.In a Java application, two threads are each holding a lock and waiting for the other to release its lock. Which Java feature can help detect this deadlock?

    • AUsing synchronized blocks
    • BGarbage collection logs
    • CThreadMXBean's findDeadlockedThreads()
    • DThread priority adjustment
  3. 3.Your system runs a deadlock detection algorithm every time CPU utilization drops below 50%. What is the trade-off of this approach?

    • AHigh detection frequency increases overhead
    • BIt always resolves deadlocks immediately
    • CLow detection frequency misses deadlocks
    • DIt prevents deadlocks from occurring
  4. 4.During deadlock recovery, why might preempting resources from a process lead to starvation?

    • APreempted resources are permanently lost
    • BPreempting is faster than termination
    • CPreemption increases system load
    • DProcesses may never regain preempted resources
  5. 5.A system administrator decides to abort all deadlocked processes to recover from a deadlock. What is a potential downside of this approach?

    • AIt avoids resource loss
    • BIt guarantees deadlock prevention
    • CIt is the fastest recovery method
    • DIt is simple but costly
  6. 6.In a multi-instance resource environment, which algorithm is similar to the one used for deadlock detection?

    • ABanker's safety check
    • BRound-robin scheduling
    • CMutex locking
    • DPriority inversion handling
  7. 7.A developer notices that their Java application occasionally hangs. They suspect a deadlock. What tool can they use to programmatically check for deadlocks?

    • AJava Memory Model
    • BJava Debugger (jdb)
    • CGarbage Collector
    • DThreadMXBean
  8. 8.Why might running a deadlock detection algorithm on every resource request be impractical?

    • AIt is the only way to detect deadlocks
    • BIt prevents all deadlocks
    • CIt incurs significant performance overhead
    • DIt guarantees real-time detection