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

Related MCQs

• What is a mutex?
• What will happen when a process terminates?
• Which of the following does not support more than one program at a time?
• Segment replacement algorithms are more complex than page replacement algorithms because                          
• To                to a safe state, the system needs to keep more information about the states of processes.
• If one or more devices use a common set of wires to communicate with the computer system, the connection is called              
• 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?
• ‘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                          
• When the memory allocated to a process is slightly larger than the process, then