Operating System Set 11 MCQs

Q1 | A parent process calling system call will be suspended until children processes terminate.

wait

fork

exit

exec

Q2 | Cascading termination refers to termination of all child processes before the parent terminates

normally

abnormally

normally or abnormally

none of the mentioned

Q3 | In UNIX, each process is identified by its

process control block

device queue

process identifier

none of the mentioned

Q4 | The child process can

be a duplicate of the parent process

never be a duplicate of the parent process

cannot have another program loaded into it

never have another program loaded into it

Q5 | The child process completes execution, but the parent keeps executing, then the child process is known as

orphan

zombie

body

dead

Q6 | What is Inter process communication?

allows processes to communicate and synchronize their actions when using the same address space

allows processes to communicate and synchronize their actions without using the same address space

allows the processes to only synchronize their actions without communication

none of the mentioned

Q7 | Message passing system allows processes to

communicate with one another without resorting to shared data

communicate with one another by resorting to shared data

share data

name the recipient or sender of the message

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

write & delete message

delete & receive message

send & delete message

receive & send message

Q9 | Messages sent by a process

have to be of a fixed size

have to be a variable size

can be fixed or variable sized

none of the mentioned

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

communication link

message-passing link

synchronization link

all of the mentioned

Q11 | Which of the following are TRUE for direct communication?

a communication link can be associated with n number of process(n = max. number of processes supported by system)

a communication link can be associated with exactly two processes

exactly n/2 links exist between each pair of processes(n = max. number of processes supported by system)

exactly two link exists between each pair of processes

Q12 | In indirect communication between

there is another process r to handle and pass on the messages between p and q

there is another machine between the two processes to help communication

there is a mailbox to help communication between p and q

none of the mentioned

Q13 | In the non blocking send

the sending process keeps sending until the message is received

the sending process sends the message and resumes operation

the sending process keeps sending until it receives a message

none of the mentioned

Q14 | In the Zero capacity queue

the queue can store at least one message

the sender blocks until the receiver receives the message

the sender keeps sending and the messages don’t wait in the queue

none of the mentioned

Q15 | The Zero Capacity queue

is referred to as a message system with buffering

is referred to as a message system with no buffering

is referred to as a link

none of the mentioned

Q16 | Concurrent access to shared data may result in

data consistency

data insecurity

data inconsistency

none of the mentioned

Q17 | 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

data consistency

race condition

aging

starvation

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

program

critical section

non – critical section

synchronizing

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

mutual exclusion

progress

bounded waiting

all of the mentioned

Q20 | Mutual exclusion implies that

if a process is executing in its critical section, then no other process must be executing in their critical sections

if a process is executing in its critical section, then other processes must be executing in their critical sections

if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution

none of the mentioned

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

after a process has made a request to enter its critical section and before the request is granted

when another process is in its critical section

before a process has made a request to enter its critical section

none of the mentioned

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

one

two

three

four

Q23 | In the bakery algorithm to solve the critical section problem

each process is put into a queue and picked up in an ordered manner

each process receives a number (may or may not be unique) and the one with the lowest number is served next

each process gets a unique number and the one with the highest number is served next

each process gets a unique number and the one with the lowest number is served next

Q24 | An un-interruptible unit is known as

single

atomic

static

none of the mentioned

Q25 | TestAndSet instruction is executed

after a particular process

periodically

atomically

none of the mentioned