A segment of code that cannot be entered and executed by more than one process at the same time is called _________________. deadlock critical section semaphore mutex   A process that does not enter a critical section but also prevents other processes from entering is creating _______________. deadlock mutual exclusion lockout starvation   Multiple processes that block each other indefinitely from entering a critical section are creating _____________. mutual exclusion starvation deadlock logout   Using semaphores. s = 0 initially. Process p1 executes the sequence: P(s); V(s); P(s); V(s); Process p2 executes the sequence: V(s); V(s); P(s); V(s); After both processes terminate, s=________. 3 1 0 2   A monitor  is a low-level kernel function that implements a priority queue. True or false   Processes can access and modify monitor variables without having to call the monitor's functions. True False   The correct monitor implementation of c.wait  places the calling process in a waiting queue. True False   Using a monitor with a priority queue Process p1 calls wakeme(7) at time now = 2 Process p2 calls wakeme(2) at time now = 4 Process p3 calls wakeme(6) at time now = 1 Process p4 calls wakeme(3) at time now = 5 Process __________ leaves the monitor first. p3 p4 p2 p1

Using a monitor with a priority queue

Process p1 calls wakeme(7) at time now = 2
Process p2 calls wakeme(2) at time now = 4
Process p3 calls wakeme(6) at time now = 1
Process p4 calls wakeme(3) at time now = 5

Process __________ leaves the monitor first.