Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S); respectively. The above situation depicts a _________.

Related MCQs

• What are the two atomic operations permissible on semaphores?
• A counting semaphore was initialized to 10. Then 6 P (wait) operations and 4V (signal) operations were completed on this semaphore. The resulting value of the semaphore is ___________
• A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called:
• Paths that have an unbounded number of allowed nonminimal hops from packet sources, this situation is referred to as __________.
• ___________ are used for signaling among processes and can be readily used to enforce a mutual exclusion discipline.
• The routine ________________ combines data from all processes by adding them in this case and returning the result to a single process.
• A minimum of _____ variable(s) is/are required to be shared between processes 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 ___________.
• A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then _____________
• ____________ is the ability of multiple processes to co-ordinate their activities by exchange of information.