adplus-dvertising
frame-decoration

Question

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

Answer: (b).each process receives a number (may or may not be unique) and the one with the lowest number is served next

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In the bakery algorithm to solve the critical section problem :

Similar Questions

Discover Related MCQs

Q. An un-interruptible unit is known as :

Q. The TestAndSet instruction is executed :

Q. Semaphore is a/an _______ to solve the critical section problem.

Q. The two atomic operations permissible on semaphores are :

Q. Spinlocks are :

Q. The main disadvantage of spinlocks is that :

Q. The wait operation of the semaphore basically works on the basic _______ system call.

Q. The signal operation of the semaphore basically works on the basic _______ system call.

Q. If the semaphore value is negative :

Q. The code that changes the value of the semaphore is :

Q. What will happen if a non-recursive mutex is locked more than once ?

Q. A semaphore :

Q. The two kinds of semaphores are :

Q. A mutex :

Q. At a particular time of computation the value of a counting semaphore is 7.Then 20 P operations and 15 V operations were completed on this semaphore.The resulting value of the semaphore is :

Q. A binary semaphore is a semaphore with integer values :

Q. Semaphores are mostly used to implement :

Q. Spinlocks are intended to provide __________ only.

Q. The bounded buffer problem is also known as :

Q. In the bounded buffer problem, there are the empty and full semaphores that :