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

Question #140 of 1,002+ in Operating System

📝 Question #140

⌨️ Press A B C D to select

✓

All Options & Correct Answer

A each process is put into a queue and picked up in an ordered manner Correct

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

📚 Want More?

1,002+ questions with detailed answers