Critical section problem in Operating Systems - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is the critical section in the context of operating systems?

A critical section is a part of a program where shared resources are accessed and modified. Only one process should execute in this section at a time to avoid conflicts.

intermediate

Name the three main requirements to solve the critical section problem.

1. Mutual Exclusion: Only one process in the critical section at a time.
2. Progress: If no process is in the critical section, others can enter.
3. Bounded Waiting: Each process gets a chance to enter after a limited wait.

beginner

Why is mutual exclusion important in the critical section problem?

Mutual exclusion prevents multiple processes from accessing shared resources simultaneously, which avoids data corruption and inconsistent results.

beginner

What can happen if the critical section problem is not handled properly?

If not handled, race conditions can occur where processes interfere with each other, leading to incorrect data, crashes, or unpredictable behavior.

intermediate

Explain the concept of bounded waiting in the critical section problem.

Bounded waiting ensures that every process gets a chance to enter the critical section after a limited number of other processes have entered, preventing indefinite waiting or starvation.

Which of the following is NOT a requirement to solve the critical section problem?

A Mutual Exclusion

B Progress

C Bounded Waiting

D Deadlock

Deadlock is a problem that can occur but is not a requirement to solve the critical section problem. The three requirements are Mutual Exclusion, Progress, and Bounded Waiting.

What does mutual exclusion ensure in the critical section problem?

A Only one process accesses the critical section at a time

B Processes wait forever to enter the critical section

C Processes can enter the critical section simultaneously

D Processes never enter the critical section

Mutual exclusion ensures that only one process can be inside the critical section at any given time.

What problem arises if multiple processes enter the critical section simultaneously?

A Progress

B Deadlock

C Race condition

D Bounded waiting

Race condition happens when multiple processes access and modify shared data simultaneously, causing unpredictable results.

Which condition ensures that no process waits forever to enter the critical section?

A Bounded Waiting

B Progress

C Mutual Exclusion

D Deadlock

Bounded waiting guarantees that each process will get a chance to enter the critical section after a limited wait.

What is the main goal of solving the critical section problem?

A To allow multiple processes to run at the same time

B To prevent processes from accessing shared resources simultaneously

C To increase CPU speed

D To avoid using shared resources

The main goal is to prevent multiple processes from accessing shared resources at the same time to avoid conflicts.

Describe the critical section problem and explain why it is important in operating systems.

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

List and explain the three main requirements to solve the critical section problem.

These requirements ensure safety, liveness, and fairness.

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