Q. In the bakery algorithm to solve the critical section problem (Solved)
1. each process is put into a queue and picked up in an ordered manner
2. each process receives a number (may or may not be unique) and the one with the lowest number is served next
3. each process gets a unique number and the one with the highest number is served next
4. each process gets a unique number and the one with the lowest number is served next
- b. each process receives a number (may or may not be unique) and the one with the lowest number is served next