In the bakery algorithm to solve the critical section problem                          

Related MCQs

• Which of the following conditions must be satisfied to solve the critical section problem?
• A minimum of            variable(s) is/are required to be shared between processes to solve the critical section problem.
• Semaphore is a/an                to solve the critical section problem.
• If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called?
• An SJF algorithm is simply a priority algorithm where the priority is                          
• Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section
• Another solution to the problem of external fragmentation problem is to                          
• A thread shares its resources(like data section, code section, open files, signals) with
• The                  can be turned off by the CPU before the execution of critical instruction sequences that must not be interrupted.
• The Banker's algorithm is used