A. Programmed buffering
B. Automatic buffering
C. User defined buffering
D. No buffering

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

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

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

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

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

A. communication link
B. message-passing link
C. synchronization link
D. all of the mentioned

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

A. write & delete message
B. delete & receive message
C. send & delete message
D. receive & send message

A. communicate with each other without sharing 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