Operating Systems - Critical Section Problem - Requirements & Peterson's Solution
Identify the subtle bug in this statement about Peterson's algorithm: "It guarantees mutual exclusion and progress but does not guarantee bounded waiting."
Identify the subtle bug in this statement about Peterson's algorithm: "It guarantees mutual exclusion and progress but does not guarantee bounded waiting."
medium🐞 Bug Identification Q7 of Q15
Step-by-Step Solution
Solution:
Step 1: Recall Peterson's algorithm guarantees
It guarantees mutual exclusion, progress, and bounded waiting.Step 2: Analyze the statement
The statement claims bounded waiting is not guaranteed, which is false.Step 3: Verify other options
Mutual exclusion and progress are guaranteed, so options B and C are incorrect. The statement is correct as is contradicts known facts.Final Answer:
Option D -> Option DQuick Check:
Peterson's algorithm guarantees bounded waiting [OK]
Quick Trick: Peterson's algorithm guarantees bounded waiting [OK]
Common Mistakes:
MISTAKES- Believing bounded waiting is not guaranteed
- Confusing progress with bounded waiting
Trap Explanation:
PITFALL- Candidates often confuse bounded waiting with progress, leading to incorrect claims about guarantees.
Interviewer Note:
CONTEXT- Tests precise knowledge of Peterson's algorithm guarantees.
Master "Critical Section Problem - Requirements & Peterson's Solution" in Operating Systems
Want More Practice?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All QuestionsMore Operating Systems Quizzes