Which of the following scheduling algorithms is non-preemptive?

Where does the swap space reside?

Suppose a processor does not have any stack pointer register. Which of the following statements is true?

Let m[0] ..m[4] be mutexes (binary semaphores) and P[0] ...P[4] be processes. Suppose each process P[i] executes the following:

wait (m[i]); wait (m(m[(i+1) mod 4]))0;
.......
release (m[i]); release (m[(i+1) mod 4]);

This could cause