A. Allows processes to communicate and synchronize their actions when using the same address space
B. Allows processes to communicate and synchronize their actions
C. Mechanism is used by cooperating processes to exchange data and information. there are two models of ipc: ? shared memory ? message passing
D. None of the mentioned
Explanation: Interprocess Communication allows processes to communicate and synchronize their actions. Interprocess Communication (IPC) mechanism is used by cooperating processes to exchange data and information. There are two models of IPC: → Shared Memory → Message Passing
A. Communicate with each other without sharing the same address space
B. Communicate with one another by resorting to shared data
C. Share data
D. Name the recipient or sender of the message
Explanation: Message Passing system allows processes to communicate with each other without sharing the same address space.
A. Write & delete message
B. Delete & receive message
C. Send & delete message
D. Receive & send message
Explanation: Two operations provided by the IPC facility are receive and send messages. Exchange of data takes place in cooperating processes.
A. Have to be of a fixed size
B. Have to be a variable size
C. Can be fixed or variable sized
D. None of the mentioned
Explanation: Messages sent by a process can be fixed or variable size. If the message size of the process is fixed then system level implementation is straightforward but it makes the task of programming more difficult. If the message size of the process is variable then system level implementation is more complex but it makes the task of programming simpler.
A. Communication link
B. Message-passing link
C. Synchronization link
D. All of the mentioned
Explanation: The link between two processes P and Q to send and receive messages is called communication link. Two processes P and Q want to communicate with each other; there should be a communication link that must exist between these two processes so that both processes can able to send and receive messages using that link.
A. A communication link can be associated with n number of process(n = max. number of processes supported by system)
B. A communication link is 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
Explanation: For direct communication, a communication link is associated with exactly two processes. One communication link must exist between a pair of processes.
A. There is another process r to handle and pass on the messages between p and q
B. There is another machine between the two processes to help communication
C. There is a mailbox to help communication between p and q
D. None of the mentioned
Explanation: In indirect communication between processes P and Q there is a mailbox to help communication between P and Q. A mailbox can be viewed abstractly as an object into which messages can be placed by processes and from which messages can be removed.
A. The sending process keeps sending until the message is received
B. The sending process sends the message and resumes operation
C. The sending process keeps sending until it receives a message
D. None of the mentioned
Explanation: In the non blocking send, the sending process sends the message and resumes operation. Sending process doesn’t care about reception. It is also known as asynchronous send.
A. The queue can store at least one message
B. The sender blocks until the receiver receives the message
C. The sender keeps sending and the messages don’t wait in the queue
D. None of the mentioned
Explanation: In the Zero capacity queue the sender blocks until the receiver receives the message. Zero capacity queue has maximum capacity of Zero; thus message queue does not have any waiting message in it.
A. Is referred to as a message system with buffering
B. Is referred to as a message system with no buffering
C. Is referred to as a link
D. None of the mentioned
Explanation: The Zero capacity queue is referred to as a message system with no buffering. Zero capacity queue has maximum capacity of Zero; thus message queue does not have any waiting message in it.