Why deadlocks freeze system progress in Operating Systems - See It in Action

Why Deadlocks Freeze System Progress

📖 Scenario: Imagine a busy office where several employees need to use shared printers and scanners. Sometimes, two employees each hold one device and wait for the other device to become free, causing all work to stop.

🎯 Goal: Build a simple explanation model that shows how deadlocks occur and why they freeze system progress.

📋 What You'll Learn

Create a dictionary called resources with two keys: 'Printer' and 'Scanner', each with a value of 1 representing one device available.

Create a dictionary called employees with two keys: 'Alice' and 'Bob', each with a list of resources they currently hold.

Create a variable called waiting that shows which resource each employee is waiting for.

Write a simple check to detect if both employees are waiting for a resource held by the other, indicating a deadlock.

💡 Why This Matters

🌍 Real World

Deadlocks can happen in computers when programs wait forever for resources, causing the system to freeze or slow down.

💼 Career

Understanding deadlocks is important for software developers and system administrators to design systems that avoid freezing and improve reliability.

1

Set up the available resources

Create a dictionary called resources with these exact entries: 'Printer': 1 and 'Scanner': 1 to represent one printer and one scanner available.

Operating Systems

# Create the resources dictionary with 'Printer' and 'Scanner' each set to 1
# Your code here

Need a hint?

Use curly braces to create a dictionary with keys 'Printer' and 'Scanner' and values 1.

2

Set up employees and their held resources

Create a dictionary called employees with keys 'Alice' and 'Bob'. Set Alice to hold ['Printer'] and Bob to hold ['Scanner'].

Operating Systems

resources = {'Printer': 1, 'Scanner': 1}
# Create the employees dictionary with Alice holding ['Printer'] and Bob holding ['Scanner']
# Your code here

Need a hint?

Use a dictionary with lists as values to show which resources each employee holds.

3

Set up waiting resources for each employee

Create a dictionary called waiting with keys 'Alice' and 'Bob'. Set Alice to wait for 'Scanner' and Bob to wait for 'Printer'.

Operating Systems

resources = {'Printer': 1, 'Scanner': 1}
employees = {'Alice': ['Printer'], 'Bob': ['Scanner']}
# Create the waiting dictionary with Alice waiting for 'Scanner' and Bob waiting for 'Printer'
# Your code here

Need a hint?

Use a dictionary to show which resource each employee is waiting for.

4

Detect deadlock condition

Write an if statement that checks if Alice is waiting for a resource held by Bob and Bob is waiting for a resource held by Alice. Use if waiting['Alice'] in employees['Bob'] and waiting['Bob'] in employees['Alice']: to detect deadlock.

Operating Systems

resources = {'Printer': 1, 'Scanner': 1}
employees = {'Alice': ['Printer'], 'Bob': ['Scanner']}
waiting = {'Alice': 'Scanner', 'Bob': 'Printer'}
# Write an if statement to detect deadlock where Alice waits for Bob's resource and Bob waits for Alice's resource
# Your code here

Need a hint?

Use the in keyword to check if the resource Alice waits for is in Bob's held resources and vice versa.