Q.

n Leve Question A B C D E Answe

o l r
1 Which process can be affected by child process init process A
other processes executing in the cooperating process parent process
system?
2 When several processes access the race condition critical B
same data concurrently and the condition
outcome of the execution depends essential
dynamic condition
on the particular order in which the condition
access takes place is called
________
3 If a process is executing in its critical exclusion asynchrono A
critical section, then no other us exclusion
synchronous
processes can be executing in their mutual exclusion
exclusion
critical section. What is this
condition called?
4 Which one of the following is a pipe socket C
thread semaphore
synchronization tool?
5 that cannot be more that cannot that cannot A
A semaphore is a shared integer that cannot drop
than zero drop below be more than
variable __________ below zero
one one
6 binary semaphores both mutex none of the C
Mutual exclusion can be provided locks and mentioned
mutex locks
by the __________ binary
semaphores
7 When high priority task is indirectly priority removal priority A
preempted by medium priority task modification
priority
effectively inverting the relative priority inversion
exchange
priority of the two tasks, the
scenario is called __________
8 software level both hardware none of the C
Process synchronization can be
hardware level and software mentioned
done on __________
level
9 procedures that synchronizatio all of the D
operate on shared n between mentioned
A monitor is a module that shared data
data structure concurrent
encapsulates __________ structures
procedure
invocation
10 a condition variable condition variables all of the A
To enable a process to wait within semaphore
must be declared as must be used as mentioned
the monitor __________ must be used
condition boolean objects
11 Concurrent access to shared data data insecurity data none of the C
data consistency mentioned
may result in ____________ inconsistency
12 The segment of code in which the Critical section synchronizin B
process may change common Non-critical g
program
variables, update tables, write into section
files is known as ____________
13 Which of the following conditions Progress All of the D
Bounded
must be satisfied to solve the critical Mutual Exclusion mentioned
Waiting
section problem?
14 if a process is if a process is none of the A
executing in its executing in its mentioned
if a process is critical section, critical section,
executing in its then other then all the
Mutual exclusion implies that critical section, then processes must be resources of
____________ no other process executing in their the system
must be executing in critical sections must be
their critical sections blocked until it
finishes
execution
15 after a process has when another before a none of the A
Bounded waiting implies that there
made a request to process is in its process has mentioned
exists a bound on the number of
enter its critical critical section made a request
times a process is allowed to enter
section and before to enter its
its critical section ____________
the request is granted critical section
16 A minimum of _____ variable(s) TWO FOUR B
is/are required to be shared between
ONE THREE
processes to solve the critical
section problem.
17 Semaphore is a/an _______ to solve hardware for a special program for integer none of the C
the critical section problem. system a system variable mentioned
18 What are the two atomic operations stop None of the A
wait hold
permissible on semaphores? mentioned
19 The wait operation of the block() wait() B
semaphore basically works on the stop() hold()
basic _______ system call.
20 The signal operation of the wakeup() start() B
semaphore basically works on the continue() getup()
basic _______ system call.
21 it is invalid no operation none of the A
can be further mentioned
its magnitude is the performed on
If the semaphore value is negative number of processes it until the
____________ waiting on that signal
semaphore operation is
performed on
it
22 The code that changes the value of remainder section non – critical critical section none of the C
the semaphore is ____________ code section code code mentioned

23 after a process has when another before a none of the A

Bounded waiting implies that there process is in its mentioned
made a request to process has
exists a bound on the number of critical section
enter its critical made a request
times a process is allowed to enter
section and before to enter its
its critical section .....
the request is granted critical section
24 Every time a request for allocation the set of processes the set of processes the specific all of the A
cannot be granted immediately, the that have been in the deadlock process that mentioned
detection algorithm is invoked. This deadlocked queue caused the
 will help identify ____________ deadlock
25 A system has 3 processes sharing 4 may occur none of the A
resources. If each process needs a mentioned
can never occur has to occur
maximum of 2 units then, deadlock
____________
26 that can be used by That can be used by None of the A
that can be
one process at a time more than one mentioned
What is a reusable resource shared by
and is not depleted process at a time
various threads
by that use
27 A process may hold No resource All of the D
Which of the following condition is allocated resources can be forcibly mentioned
required for a deadlock to be Mutual exclusion while awaiting removed from
possible? assignment of other a process
resources holding it
28 at fixed time every time a none of the C
every time a intervals resource mentioned
For an effective operating system,
resource request is request is
when to check for deadlock?
made made at fixed
time intervals
29 a process may hold no resource all of the D
Which of the following condition is allocated resources can be forcibly mentioned
required for a deadlock to be mutual exclusion while awaiting removed from
possible? assignment of other a process
resources holding it
30 the system can there exist a safe none of the A
allocate resources to sequence mentioned
A system is in the safe state if all of the
____________ each process in some
mentioned
order and still avoid
a deadlock
Which one of the following is a starvation graph none of the A
31 visual ( mathematical ) way to resource allocation inversion mentioned
determine the deadlock occurrence? graph graph
32 resource allocation inversion A
there must be a fixed all deadlocked
To avoid deadlock ____________ must be done only technique
number of resources processes must
once can be used
to allocate be aborted
33 Which one of the following is the round-robin karn’s A
elevator
deadlock avoidance algorithm? banker’s algorithm algorithm algorithm
algorithm
34 in advance processes the number of all of the D
What is the drawback of banker’s processes changes resource once mentioned
rarely know how
algorithm? as time progresses available can
much resource they
disappear
will need
35 all resources have all resources all of the A
The wait-for graph is a deadlock multiple instances mentioned
detection algorithm that is all resources have a have a single 7
applicable when ____________ single instance multiple
instances
36 Pj is waiting for Pi Pj is waiting A
An edge from process Pi to Pj in a Pi is waiting for Pj to to release a Pi is waiting for Pi to
wait for graph indicates that release a resource resource that Pj for Pj to leave leave the
____________ that Pi needs needs the system system

37 abort all the none of the A

A deadlock can be broken by abort one or more preempt all
process in the mentioned
____________ processes to break resources from
system
the circular wait all processes
38 A deadlock eventually cripples drop None of the B
system throughput and will cause increase Stay still mentioned
the CPU utilization to ______
39 ‘m’ processes share ‘n’ resources of May occur None of the A
the same type. The maximum need mentioned
of each process doesn’t exceed ‘n’
can never occur Has to occur
and the sum of all their maximum
needs is always less than m+n. In
this setup, deadlock ____________
40 the number of all of the A
the number of resources must be mentioned
resource
What is the solution to starvation? rollbacks must be included in
preemption be
included in the cost resource
done instead
factor preemption