adplus-dvertising
frame-decoration

Question

In UNIX, each process is identified by its :

a.

Process Control Block

b.

Device Queue

c.

Process Identifier

d.

None of these

Answer: (c).Process Identifier

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

Q. The child process can :

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

Q. Inter process communication :

Q. Messages sent by a process :

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

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

Q. In indirect communication between processes P and Q :

Q. In the non blocking send :

Q. In the Zero capacity queue :

Q. The Zero Capacity queue :

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

Q. Main function of shared memory is:

Q. A critical section is a program segment 

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?

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

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'?

Q. What is said to happen when the result of computation depends on the speed of the processes involved?

Q. Consider a counting semaphore which was initialized to 10 and then 6P (wait) operations and 4v(signal) operations were completed on this semaphore. What is the resulting value of semaphore?

Q. Let P1 and P2 be the two processes and S1 and S2 be the two shared Boolean variables. The initial values of S1 and S2 are randomly assigned. For accessing the critical sections of P1 and P2 the methods used by them are given below:

Method used by P1
While ( S1 == S2 );
Critical section
S1 = S2;

Method used by P2
While ( S1! = S2 )
Critical section
S2 = not (S1);

Which statement / s describes that the properties are achieved?