In the bakery algorithm to solve the critical section problem

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Operating System (OS)

Q. In the bakery algorithm to solve the critical section problem

(A) each process is put into a queue and picked up in an ordered manner
(B) each process receives a number (may or may not be unique) and the one with the lowest number is served next
(C) each process gets a unique number and the one with the highest number is served next
(D) each process gets a unique number and the one with the lowest number is served next

💬 Discuss

✅ Correct Answer: (B) each process receives a number (may or may not be unique) and the one with the lowest number is served next

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

397

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

85%

Success Rate