📝 Peterson's Solution

📖 From Operating System • 5. Process Synchronization • 51 questions available

Practice MCQs for Peterson's Solution. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-09

Easy Questions

Medium Questions

Hard Questions

Q1. What is the fundamental nature of Peterson's solution?

🔹 A. A hardware-based solution for process synchronization.

🔹 B. A software-based solution for the critical-section problem.

🔹 C. A compiler-level optimization for concurrent programming.

🔹 D. An operating system scheduling algorithm.

💡 Difficulty: easy | ✅ Correct: B

Q2. In Peterson's solution, what does the variable `turn == i` signify?

🔹 A. Process Pj is in its critical section.

🔹 B. Process Pi is not ready to enter the critical section.

🔹 C. Process Pi is allowed to execute in its critical section.

🔹 D. The critical section is empty.

💡 Difficulty: medium | ✅ Correct: C

Q3. According to the proof of Peterson's solution, what condition must be true for process Pi to enter its critical section?

🔹 A. `flag[j] == true` and `turn == i`.

🔹 B. `flag[j] == false` or `turn == i`.

🔹 C. `flag[i] == true` and `turn == j`.

🔹 D. `flag[j] == true` or `turn == j`.

💡 Difficulty: hard | ✅ Correct: B

⬆️ View all questions in the quiz below

🚀 Start Quiz 📝 Practice Mode