Q
In the bakery algorithm to solve the critical section problem ____________
-
A
A. Each process is put into a queue and picked up in an ordered manner
-
B
B. Each process receives a number (may or may not be unique) and the one with the lowest number is served next
-
C
C. Each process gets a unique number and the one with the highest number is served next
-
D
D. Each process gets a unique number and the one with the lowest number is served next
Correct Answer:
B. B. Each process receives a number (may or may not be unique) and the one with the lowest number is served next
