Q. Situations where two or more processes are reading or writing some shared data and the final results depends on the order of usage of the shared data, are called ________.

View solution

Q. When two or more processes attempt to access the same resource a _________ occurs.

View solution

Q. A process is starved

View solution

Q. 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 _________ .

View solution

Q. The state of a process after it encounters an I/O instruction is __________.

View solution

Q. The Banker's algorithm is used

View solution

Q. ______ is a high level abstraction over Semaphore.

View solution

Q. In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This voilates the _______________ condition of deadlock.

View solution

Q. Banker's algorithm for resource allocation deals with ?

View solution

Q. What is the maximum number of processes that may enter simultaneously inside the critical section to avoid race condition ?

View solution

Q. What are global locks ?

View solution

Q. Semophores are used to solve the problem of

View solution

Q. Semaphores function is to

View solution

Q. Four necessary conditions for deadlock are non pre-emption, circular wait, hold and wait and

View solution

Q. Banker's algorithm deals with

View solution

Q. Which of following is not a condition of Dead Lock ?

View solution

Q. A solution to the Dining Philosophers Problem which avoids deadlock is 

View solution

Q. 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[(i+1) mode 4]); 
  .........
  release (m[i]); release (m[(i+1)mod 4]); 
This could cause 

View solution

Q. What are the necessary conditions to occur the deadlock?

View solution

Q. Deadlocks can be described by which graph?

View solution