Critical section problem in Operating Systems - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

What is the main purpose of the critical section in concurrent programming?

In the context of concurrent programming, what is the primary goal of the critical section?

A To ensure that only one process accesses a shared resource at a time to prevent data inconsistency

B To allow multiple processes to access shared resources simultaneously without restrictions

C To increase the speed of all processes by running them in parallel without any synchronization

D To prevent any process from accessing the CPU during execution

💡 Hint

Think about what happens when multiple processes try to change the same data at once.

The critical section is a part of the program where shared resources are accessed. The main goal is to prevent multiple processes from entering this section simultaneously to avoid conflicts and data corruption.

📋 Factual

intermediate

Which of the following is NOT a necessary condition for solving the critical section problem?

Identify the condition that is not required to solve the critical section problem.

A Mutual exclusion

B Progress

C Bounded waiting

D Infinite waiting

💡 Hint

Consider what would happen if a process had to wait forever to enter the critical section.

The three necessary conditions are mutual exclusion, progress, and bounded waiting. Infinite waiting (also called starvation) is undesirable and must be avoided.

🔍 Analysis

advanced

What will happen if mutual exclusion is not enforced in the critical section?

Consider a scenario where multiple processes enter the critical section simultaneously without mutual exclusion. What is the most likely outcome?

A Processes will execute faster without any issues

B The system will automatically prevent conflicts without programmer intervention

C Data inconsistency and race conditions may occur

D Processes will be blocked indefinitely

💡 Hint

Think about what happens when two people try to write on the same paper at the same time.

Without mutual exclusion, multiple processes can modify shared data simultaneously, leading to race conditions and inconsistent or corrupted data.

❓ Comparison

advanced

Which synchronization mechanism guarantees mutual exclusion by disabling interrupts?

Among the following synchronization methods, which one achieves mutual exclusion by disabling interrupts on a single processor system?

A Semaphores

B Disabling interrupts

C Monitors

D Message passing

💡 Hint

Consider how the CPU can prevent context switches during critical section execution.

Disabling interrupts prevents the CPU from switching processes, ensuring the current process completes its critical section without interruption, thus achieving mutual exclusion on a single processor.

❓ Reasoning

expert

Why is the critical section problem more challenging in multiprocessor systems compared to single processor systems?

Explain why ensuring mutual exclusion in the critical section is more complex on multiprocessor systems than on single processor systems.

A Because disabling interrupts is ineffective since multiple processors run simultaneously

B Because processes do not share memory in multiprocessor systems

C Because multiprocessor systems do not require synchronization mechanisms

D Because single processor systems have more processes running at the same time

💡 Hint

Think about how multiple CPUs can execute code at the same time.

In multiprocessor systems, disabling interrupts on one processor does not stop other processors from executing, so other synchronization methods like locks or semaphores are needed to ensure mutual exclusion.

Practice

1. What is the main goal of the critical section problem in operating systems?

easy

A. To ensure only one process accesses shared resources at a time

B. To allow multiple processes to access resources simultaneously

C. To speed up the execution of all processes

D. To prevent processes from running in parallel

Solution

1. Step 1: Understand the critical section concept

   The critical section is a part of the program where shared resources are accessed.

2. Step 2: Identify the problem goal

   The goal is to prevent multiple processes from entering the critical section simultaneously to avoid conflicts.

3. Final Answer:

   To ensure only one process accesses shared resources at a time -> Option A

4. Quick Check:

   Critical section = exclusive access [OK]

Hint: Only one process can be inside critical section at once [OK]

Common Mistakes:

• Thinking multiple processes can safely access shared data simultaneously
• Confusing critical section with process scheduling
• Believing critical section speeds up all processes

2. Which of the following is a correct way to indicate a process is in its critical section using a flag variable flag[i]?

easy

A. flag[i] = true

B. flag[i] = -1

C. flag[i] = 0

D. flag[i] = false

Solution

1. Step 1: Understand flag usage in critical section

   A flag variable is often used to indicate if a process wants to enter or is inside the critical section.

2. Step 2: Identify correct flag value for 'in critical section'

   Setting flag[i] = true means the process is active or wants to enter the critical section.

3. Final Answer:

   flag[i] = true -> Option A

4. Quick Check:

   Flag true means process active [OK]

Hint: True means process wants or is inside critical section [OK]

Common Mistakes:

• Using 0 or false to indicate active process
• Confusing flag values with process IDs
• Using negative values for flags

3. Consider this pseudocode for two processes P0 and P1 using flags to enter critical section:

flag[0] = true
while(flag[1]) { /* wait */ }
// critical section
flag[0] = false

What happens if both processes set their flags to true at the same time?

medium

A. Both enter critical section simultaneously

B. Both skip critical section

C. Both wait forever (deadlock)

D. One waits while the other enters critical section

Solution

1. Step 1: Analyze the waiting condition

   Each process waits while the other's flag is true, so if both flags are true simultaneously, both wait.

2. Step 2: Identify the outcome

   Since both wait for the other to clear their flag, neither proceeds, causing deadlock.

3. Final Answer:

   Both wait forever (deadlock) -> Option C

4. Quick Check:

   Both flags true = deadlock [OK]

Hint: Both flags true means both wait forever [OK]

Common Mistakes:

• Assuming both can enter critical section simultaneously
• Thinking one process always proceeds first
• Ignoring the waiting loop condition

4. In the following code snippet, what is the main error that can cause the critical section problem?

flag[i] = true
while(flag[j]) {
  // do nothing
}
// critical section
flag[i] = false

Assuming two processes P0 and P1 use this code with i=0, j=1 and vice versa.

medium

A. Infinite loop if flag[j] is false

B. No mutual exclusion, both can enter critical section

C. Flag reset happens before critical section

D. Deadlock if both set flag true simultaneously

Solution

1. Step 1: Understand the waiting condition

   Each process waits while the other process's flag is true.

2. Step 2: Identify the error scenario

   If both processes set their flags to true simultaneously, both wait forever, causing deadlock.

3. Final Answer:

   Deadlock if both set flag true simultaneously -> Option D

4. Quick Check:

   Simultaneous flags true = deadlock [OK]

Hint: Both flags true causes deadlock, not mutual exclusion [OK]

Common Mistakes:

• Thinking both can enter critical section simultaneously
• Believing flag reset is before critical section
• Assuming infinite loop if flag[j] is false

5. Which of the following solutions correctly solves the critical section problem by ensuring mutual exclusion, progress, and bounded waiting?

hard

A. Using a simple flag variable without turn variable

B. Peterson's algorithm using flags and turn variable

C. Both processes entering critical section simultaneously

D. Ignoring synchronization and relying on process speed

Solution

1. Step 1: Review solution requirements

   The solution must ensure mutual exclusion, progress, and bounded waiting to solve the critical section problem correctly.

2. Step 2: Evaluate each option

   Using a simple flag variable without turn variable lacks a turn variable, so it can cause deadlock or starvation. Peterson's algorithm using flags and turn variable uses flags and turn to guarantee all three conditions. The other options are incorrect approaches.

3. Final Answer:

   Peterson's algorithm using flags and turn variable -> Option B

4. Quick Check:

   Peterson's algorithm = correct solution [OK]

Hint: Peterson's algorithm uses flags + turn for safe access [OK]

Common Mistakes:

• Ignoring the need for a turn variable
• Assuming simple flags are enough
• Believing processes can safely ignore synchronization