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

Question

Quizplus · Accepted Answer

In the bakery algorithm, each process receives a number, and the process with the lowest number is allowed to enter the critical section next. The numbers may not be unique, but ties are broken using process IDs.

In the Bakery Algorithm to Solve the Critical Section Problem___________