Multiple Choice
Which of the following are TRUE for direct communication?
A) a communication link can be associated with n number of process(n = max. number of processes supported by system)
B) a communication link can be associated with exactly two processes
C) exactly n/2 links exist between each pair of processes(n = max. number of processes supported by system)
D) exactly two link exists between each pair of processes
Correct Answer:
Verified
Correct Answer:
Verified
Q5: Messages sent by a process_ <br>A)have to be
Q6: A minimum of_variable(s) is/are required to be
Q7: In UNIX, each process is identified by
Q8: What is Inter process communication?<br>A)allows processes to
Q9: Which of the following conditions must be
Q11: Bounded waiting implies that there exists a
Q12: In the bakery algorithm to solve the
Q13: The segment of code in which the
Q14: The child process completes execution, but the
Q15: A situation where several processes access and