Q. Cascading termination refers to termination of all child processes before the parent terminates ______.

View solution

Q. With ……………. only one process can execute at a time; meanwhile all other process are waiting for the processor. With ………….. more than one process can be running simultaneously each on a different processor.

View solution

Q. In UNIX, each process is identified by its :

View solution

Q. In UNIX, the return value for the fork system call is _____ for the child process and _____ for the parent process.

View solution

Q. The child process can :

View solution

Q. The child process completes execution,but the parent keeps executing, then the child process is known as :

View solution

Q. Inter process communication :

View solution

Q. Messages sent by a process :

View solution

Q. The link between two processes P and Q to send and receive messages is called :

View solution

Q. Which of the following are TRUE for direct communication :

View solution

Q. In indirect communication between processes P and Q :

View solution

Q. In the non blocking send :

View solution

Q. In the Zero capacity queue :

View solution

Q. The Zero Capacity queue :

View solution

Q. Bounded capacity and Unbounded capacity queues are referred to as :

View solution

Q. Main function of shared memory is:

View solution

Q. A critical section is a program segment 

View solution

Q. 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.
Method Used by P1:
while (S1 == S2) ;
Critica1 Section
S1 = S2;

Method Used by P2:
while (S1 != S2) ;
Critica1 Section
S2 = not (S1);

Which one of the following statements describes the properties achieved?

View solution

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

View solution

Q. The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0=1, S1=0, S2=0.
Process P0 :
while (true) {
wait (S0);
print (0);
release (S1);
release (S2);
}

Process P1 :
wait (S1);
Release (S0);

Process P2 :
wait (S2);
release (S0);
How many times will process P0 print '0'?

View solution