Deadlock detection and recovery in Operating Systems - Interactive Code Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to identify the condition that causes a deadlock.

Operating Systems

if (resource_allocation == [1]) {
    // Deadlock detected
}

Drag options to blanks, or click blank then click option'

Acircular_wait

Bresource_available

Cno_wait

Dpreemption

Attempts:

3 left

💡 Hint

Common Mistakes

Confusing resource availability with deadlock condition.

Thinking preemption alone causes deadlock.

The circular wait condition is one of the necessary conditions for a deadlock to occur. Detecting this condition helps identify deadlocks.

2fill in blank

medium

Complete the code to check if a process is part of a deadlock cycle.

Operating Systems

if (process_waits_for(process1, [1])) {
    // Process is in deadlock
}

Drag options to blanks, or click blank then click option'

Aresource

Bprocess2

Ccpu

Dmemory

Attempts:

3 left

💡 Hint

Common Mistakes

Checking if process waits for a resource instead of another process.

Confusing CPU or memory as the waiting entity.

Deadlock involves processes waiting for other processes to release resources, so checking if process1 waits for process2 helps detect deadlock cycles.

3fill in blank

hard

Fix the error in the deadlock detection function by completing the missing condition.

Operating Systems

function detect_deadlock() {
    for each process in processes {
        if (process.state == [1]) {
            check_cycle(process);
        }
    }
}

Drag options to blanks, or click blank then click option'

Arunning

Bready

Cterminated

Dwaiting

Attempts:

3 left

💡 Hint

Common Mistakes

Checking running or ready processes instead of waiting.

Including terminated processes in deadlock detection.

Only processes in the waiting state can be part of a deadlock, so the detection function should check those.

4fill in blank

hard

Fill both blanks to complete the recovery step after detecting deadlock.

Operating Systems

function recover_deadlock() {
    select [1] to terminate;
    release [2] held by it;
}

Drag options to blanks, or click blank then click option'

Aprocess

Bresource

Cmemory

Dcpu

Attempts:

3 left

💡 Hint

Common Mistakes

Trying to release CPU or memory directly instead of resources.

Terminating resources instead of processes.

Recovery from deadlock often involves terminating a process and releasing the resources it holds to break the deadlock cycle.

5fill in blank

hard

Fill all three blanks to complete the deadlock detection algorithm snippet.

Operating Systems

for each [1] in system {
    if ([2] waits for [3]) {
        mark as deadlocked;
    }
}

Drag options to blanks, or click blank then click option'

Aprocess

Bresource

Dthread

Attempts:

3 left

💡 Hint

Common Mistakes

Confusing threads with processes.

Swapping resource and process in the wait condition.

The algorithm checks each process to see if it waits for a resource held by another process, indicating deadlock.

Practice

1. What is the main purpose of deadlock detection in operating systems?

easy

A. To find when programs are stuck waiting forever

B. To speed up program execution

C. To allocate more memory to programs

D. To prevent viruses from entering the system

Solution

1. Step 1: Understand deadlock concept

   Deadlock happens when programs wait forever for resources held by each other.

2. Step 2: Identify deadlock detection role

   Deadlock detection finds these stuck programs so the system can fix the problem.

3. Final Answer:

   To find when programs are stuck waiting forever -> Option A

4. Quick Check:

   Deadlock detection = find stuck programs [OK]

Hint: Deadlock detection means finding stuck programs [OK]

Common Mistakes:

• Confusing detection with prevention
• Thinking it speeds up programs
• Mixing with security tasks

2. Which of the following is a correct method used in deadlock recovery?

easy

A. Terminating one or more processes

B. Encrypting data

C. Adding more RAM

D. Increasing CPU speed

Solution

1. Step 1: Review deadlock recovery methods

   Recovery fixes deadlocks by freeing resources or stopping processes causing the deadlock.

2. Step 2: Match options to recovery methods

   Terminating processes is a common way to break deadlocks by releasing resources.

3. Final Answer:

   Terminating one or more processes -> Option A

4. Quick Check:

   Recovery = stop processes to free resources [OK]

Hint: Recovery often stops processes to free resources [OK]

Common Mistakes:

• Thinking hardware upgrades fix deadlocks
• Confusing recovery with detection
• Believing encryption helps deadlocks

3. Consider a system with three processes P1, P2, P3 and resources R1, R2. If P1 holds R1 and waits for R2, P2 holds R2 and waits for R1, and P3 is idle, what does deadlock detection report?

medium

A. No deadlock detected

B. Deadlock involving P2 and P3

C. Deadlock involving P1 and P2

D. Deadlock involving all three processes

Solution

1. Step 1: Analyze resource holding and waiting

   P1 holds R1 and waits for R2; P2 holds R2 and waits for R1; P3 is idle (not waiting).

2. Step 2: Identify circular wait

   P1 and P2 are waiting on each other's resources, forming a cycle causing deadlock; P3 is not involved.

3. Final Answer:

   Deadlock involving P1 and P2 -> Option C

4. Quick Check:

   Circular wait between P1 and P2 = deadlock [OK]

Hint: Look for circular waiting processes [OK]

Common Mistakes:

• Including idle processes in deadlock
• Ignoring circular wait condition
• Assuming no deadlock if one process is idle

4. A system uses a deadlock detection algorithm but never recovers from deadlocks. What is the main problem with this approach?

medium

A. Deadlocks will be prevented automatically

B. Deadlocks will never be found

C. System will run faster

D. System will detect deadlocks but remain stuck

Solution

1. Step 1: Understand detection without recovery

   Detection finds deadlocks but does not fix them if recovery is missing.

2. Step 2: Identify system behavior

   The system will know deadlocks exist but processes remain stuck, causing hang or freeze.

3. Final Answer:

   System will detect deadlocks but remain stuck -> Option D

4. Quick Check:

   Detection alone = find deadlock, no fix [OK]

Hint: Detection finds; recovery fixes deadlocks [OK]

Common Mistakes:

• Thinking detection prevents deadlocks
• Assuming system runs faster without recovery
• Believing deadlocks won't be found

5. In a system with multiple processes and resources, which strategy best combines deadlock detection and recovery to maintain system fairness and efficiency?

hard

A. Prevent deadlocks by denying all resource requests

B. Detect deadlocks periodically and terminate the process holding the most resources

C. Ignore deadlocks and restart the system when it freezes

D. Allow deadlocks and manually fix them later

Solution

1. Step 1: Understand combined detection and recovery

   Detecting deadlocks periodically helps find problems early; recovering by terminating processes frees resources.

2. Step 2: Evaluate options for fairness and efficiency

   Terminating the process holding most resources frees maximum resources, improving system efficiency and fairness.

3. Final Answer:

   Detect deadlocks periodically and terminate the process holding the most resources -> Option B

4. Quick Check:

   Periodic detection + smart recovery = fairness and efficiency [OK]

Hint: Detect often; recover by freeing max resources [OK]

Common Mistakes:

• Preventing all requests reduces efficiency
• Ignoring deadlocks causes system freeze
• Manual fixes delay problem resolution