Deck 11: Process Management and Interprocess Communication in Unix

Question 1

A parent process calling___________system call will be suspended until children processes terminate.

A)wait
B)fork
C)exit
D)exec

Answer 1

wait

Question 2

Cascading termination refers to termination of all child processes before the parent terminates___________  

A)normally
B)abnormally
C)normally or abnormally
D)none of the mentioned

Answer 2

normally

Question 3

In UNIX, each process is identified by its

A)process control block
B)device queue
C)process identifier
D)none of the mentioned

Answer 3

process identifier

Question 4

The child process can___________      

A)be a duplicate of the parent process
B)never be a duplicate of the parent process
C)cannot have another program loaded into it
D)never have another program loaded into it

Question 5

The child process completes execution, but the parent keeps executing, then the child process is known as___________      

A)orphan
B)zombie
C)body
D)dead

Question 6

What is Inter process communication?

A)allows processes to communicate and synchronize their actions when using the same address space
B)allows processes to communicate and synchronize their actions without using the same address space
C)allows the processes to only synchronize their actions without communication
D)none of the mentioned

Question 7

Message passing system allows processes to___________      

A)communicate with one another without resorting to shared data
B)communicate with one another by resorting to shared data
C)share data
D)name the recipient or sender of the message

Question 8

Which of the following two operations are provided by the IPC facility?

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

Question 9

Messages sent by a process___________      

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

Question 10

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

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

Question 11

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

Question 12

In indirect communication between

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

Question 13

In the non blocking send___________      

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

Question 14

In the Zero capacity queue___________      

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

Question 15

The Zero Capacity queue___________      

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

Question 16

Concurrent access to shared data may result in___________

A)data consistency
B)data insecurity
C)data inconsistency
D)none of the mentioned

Question 17

A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called___________

A)data consistency
B)race condition
C)aging
D)starvation

Question 18

The segment of code in which the process may change common variables, update tables, write into files is known as___________

A)program
B)critical section
C)non - critical section
D)synchronizing

Question 19

Which of the following conditions must be satisfied to solve the critical section problem?

A)mutual exclusion
B)progress
C)bounded waiting
D)all of the mentioned

Question 20

Mutual exclusion implies that

A)if a process is executing in its critical section, then no other process must be executing in their critical sections
B)if a process is executing in its critical section, then other processes must be executing in their critical sections
C)if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution
D)none of the mentioned

Question 21

Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section

A)after a process has made a request to enter its critical section and before the request is granted
B)when another process is in its critical section
C)before a process has made a request to enter its critical section
D)none of the mentioned

Question 22

A minimum of___________variable(s) is/are required to be shared between processes to solve the critical section problem.

A)one
B)two
C)three
D)four

Question 23

In the bakery algorithm to solve the critical section problem___________

A)each process is put into a queue and picked up in an ordered manner
B)each process receives a number (may or may not be unique) and the one with the lowest number is served next
C)each process gets a unique number and the one with the highest number is served next
D)each process gets a unique number and the one with the lowest number is served next

Question 24

An un-interruptible unit is known as

A)single
B)atomic
C)static
D)none of the mentioned

Question 25

TestAndSet instruction is executed

A)after a particular process
B)periodically
C)atomically
D)none of the mentioned