Classic problems (producer-consumer, readers-writers, dining philosophers) in Operating Systems - Mini Project: Build & Apply

Classic Problems in Operating Systems

📖 Scenario: You are learning about some classic problems in operating systems that help us understand how multiple processes or threads can work together without conflicts. These problems are called Producer-Consumer, Readers-Writers, and Dining Philosophers.Imagine a bakery where bakers produce bread and customers consume it, a library where readers want to read books without disturbing each other, and friends sitting around a table sharing forks to eat spaghetti.

🎯 Goal: Build a simple conceptual model for each classic problem using basic data structures and variables. You will create the initial setup, add configuration variables, write the core logic to simulate the problem, and complete the setup with final details.

📋 What You'll Learn

Create initial data structures representing each problem

Add configuration variables like buffer size or number of readers

Implement core logic to simulate the problem's main concept

Complete the setup with final synchronization or control variables

💡 Why This Matters

🌍 Real World

These classic problems help us understand how to manage multiple processes or threads sharing resources without conflicts or deadlocks.

💼 Career

Understanding these problems is essential for roles in system programming, software development, and IT infrastructure where concurrency and resource management are critical.

1

Setup initial data structures for Producer-Consumer

Create a list called buffer that is empty and an integer variable called buffer_size set to 5 to represent the maximum items the buffer can hold.

Operating Systems

# Create an empty list called buffer
# Create an integer variable buffer_size set to 5
# Your code here

Hint

Use [] to create an empty list and assign 5 to buffer_size.

2

Add configuration for Readers-Writers problem

Create an integer variable called reader_count and set it to 0 to track how many readers are currently reading.

Operating Systems

buffer = []
buffer_size = 5
# Create an integer variable reader_count set to 0
# Your code here

Hint

Initialize reader_count with zero because no readers are reading at the start.

3

Implement core logic for Dining Philosophers problem

Create a list called forks with 5 elements, all set to True, representing that all forks are initially available.

Operating Systems

buffer = []
buffer_size = 5
reader_count = 0
# Create a list forks with 5 True values
# Your code here

Hint

Use a list with five True values to show all forks are free.

4

Complete the setup with synchronization variables

Create a boolean variable called producer_active set to True to indicate the producer is ready, and an integer variable called writer_waiting set to 0 to count writers waiting to write.

Operating Systems

buffer = []
buffer_size = 5
reader_count = 0
forks = [True, True, True, True, True]
# Create boolean producer_active set to True
# Create integer writer_waiting set to 0
# Your code here

Hint

Use True for producer_active and 0 for writer_waiting.

Practice

1. Which classic problem in operating systems involves multiple processes sharing a fixed number of resources and needing to avoid deadlock while accessing them?

easy

A. Sleeping Barber problem

B. Producer-Consumer problem

C. Readers-Writers problem

D. Dining Philosophers problem

Solution

1. Step 1: Understand the problem context

   The Dining Philosophers problem models philosophers sitting around a table sharing forks (resources) and needing to avoid deadlock.

2. Step 2: Match problem to description

   It specifically deals with multiple processes sharing limited resources and avoiding deadlock.

3. Final Answer:

   Dining Philosophers problem -> Option D

4. Quick Check:

   Deadlock with shared resources = Dining Philosophers [OK]

Hint: Deadlock with shared forks? Think Dining Philosophers [OK]

Common Mistakes:

• Confusing Producer-Consumer with resource deadlock
• Mixing Readers-Writers with resource sharing deadlock
• Choosing unrelated problems like Sleeping Barber

2. Which synchronization primitive is commonly used to solve the Producer-Consumer problem?

easy

A. Semaphore

B. Mutex

C. Barrier

D. Spinlock

Solution

1. Step 1: Identify synchronization needs in Producer-Consumer

   Producer-Consumer requires controlling access to a shared buffer and signaling availability.

2. Step 2: Match synchronization primitive

   Semaphores are used to count available slots and items, making them ideal here.

3. Final Answer:

   Semaphore -> Option A

4. Quick Check:

   Counting resources = Semaphore [OK]

Hint: Counting resources? Use Semaphore [OK]

Common Mistakes:

• Choosing Mutex which only locks/unlocks without counting
• Selecting Barrier which is for thread synchronization phases
• Confusing Spinlock with counting mechanism

3. Consider the Readers-Writers problem where multiple readers can read simultaneously but writers require exclusive access. If two readers and one writer request access at the same time, which scenario is correct?

medium

A. Both readers and writer access the resource simultaneously

B. Only one reader accesses the resource, writer waits

C. Both readers access simultaneously, writer waits

D. Writer accesses first, readers wait

Solution

1. Step 1: Recall Readers-Writers access rules

   Multiple readers can read at the same time, but writers need exclusive access.

2. Step 2: Apply rules to scenario

   When readers and writer request simultaneously, readers get access first, writer waits.

3. Final Answer:

   Both readers access simultaneously, writer waits -> Option C

4. Quick Check:

   Readers share, writer exclusive = readers first [OK]

Hint: Readers share access; writers wait for exclusivity [OK]

Common Mistakes:

• Allowing writer and readers simultaneously
• Restricting readers to one at a time
• Letting writer go first without readers finishing

4. In a solution to the Dining Philosophers problem, a programmer uses a simple lock for each fork but notices the system deadlocks. What is the most likely cause?

medium

A. All philosophers pick up their left fork simultaneously and wait for the right fork

B. Philosophers pick up forks randomly causing starvation

C. Philosophers release forks too early

D. Fork locks are not acquired atomically

Solution

1. Step 1: Understand deadlock in Dining Philosophers

   Deadlock occurs if all philosophers hold one fork and wait for the other indefinitely.

2. Step 2: Identify cause from options

   All picking left fork simultaneously and waiting for right fork causes circular wait and deadlock.

3. Final Answer:

   All philosophers pick up their left fork simultaneously and wait for the right fork -> Option A

4. Quick Check:

   Circular wait with forks = deadlock [OK]

Hint: Deadlock if all pick same fork first [OK]

Common Mistakes:

• Assuming random picking causes deadlock
• Thinking releasing forks early causes deadlock
• Ignoring atomicity of lock acquisition

5. You want to design a system where multiple producers generate data and multiple consumers process it, but the buffer size is limited. Which approach best prevents data loss and ensures synchronization?

hard

A. Allow producers to overwrite data if buffer is full

B. Use semaphores to track empty and full buffer slots with mutex for buffer access

C. Use only mutex locks for both producers and consumers

D. Use busy waiting loops for producers and consumers

Solution

1. Step 1: Identify synchronization needs

   Producers and consumers share a limited buffer; must avoid overwriting and race conditions.

2. Step 2: Choose synchronization method

   Semaphores count empty/full slots; mutex ensures exclusive buffer access, preventing data loss and race.

3. Final Answer:

   Use semaphores to track empty and full buffer slots with mutex for buffer access -> Option B

4. Quick Check:

   Counting slots + exclusive access = semaphores + mutex [OK]

Hint: Combine semaphores and mutex for safe buffer use [OK]

Common Mistakes:

• Using only mutex causes blocking but no counting
• Overwriting data loses information
• Busy waiting wastes CPU and causes inefficiency