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

Need a 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

Need a 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

Need a 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

Need a hint?

Use True for producer_active and 0 for writer_waiting.