If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called?

Related MCQs

• There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round- Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
• Which process can be affected by other processes executing in the system?
• The child process completes execution, but the parent keeps executing, then the child process is known as                      
• The child process completes execution, but the parent keeps executing, then the child process is known as
• A minimum of            variable(s) is/are required to be shared between processes to solve the critical section problem.
• Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section
• ‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock                          
• The operating system and the other processes are protected from being modified by an already running process because
• A circuitry that processes that responds to and processes the basic instructions that are required to drive a computer system is
• A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock