The following two functions P1 and P2 that share a variable B with an initial value of 2 execute concurrently.

P1( ) {
  C = B – 1;
  B = 2 * C;
}


P2( ) {
  D = 2 * B;
  B = D - 1;
}

The number of distinct values that B can possibly take after the execution is___________.

Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?

Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned.


Which of the following statement describes the properties achieved?

Which of the following scheduling algorithms is non-preemptive?