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
I got this question in an online interview.
My question comes from The Critical Section (CS) Problem and Solutions topic in portion Process Synchronization of Operating System