Operating System (3140702) MCQs

MCQs of Deadlock

Showing 11 to 20 out of 50 Questions
1 2 3 4 5
11.
Which one of the following is a visual way to determine the deadlock occurrence?
(a) Starvation graph
(b) Resource allocation graph
(c) Inversion graph
(d) None of the mentioned
Answer:

Option (b)

12.
To avoid deadlock ____________
(a) there must be a fixed number of resources to allocate
(b) resource allocation must be done only once
(c) all deadlocked processes must be aborted
(d) inversion technique can be used
Answer:

Option (a)

13.
The number of resources requested by a process ____________
(a) must always be less than the total number of resources available in the system
(b) must always be equal to the total number of resources available in the system
(c) must not exceed the total number of resources available in the system
(d) must exceed the total number of resources available in the system
Answer:

Option (c)

14.
For a deadlock to arise, which of the following conditions must hold simultaneously?
(a) Mutual exclusion
(b) No preemption
(c) Hold and wait
(d) All of the mentioned
Answer:

Option (d)

15.
For Mutual exclusion to prevail in the system ____________
(a) Each resource is either currently assigned to exactly one process or is available
(b) Process currently holding resources granted earlier can request more resources
(c) Previously granted resources cannot be forcibly taken away from process
(d) All of the mentioned
Answer:

Option (a)

16.
For a Hold and wait condition to prevail ____________
(a) each resource is either currently assigned to exactly one process or is available
(b) process currently holding resources granted earlier can request more resources
(c) previously granted resources cannot be forcibly taken away from process
(d) All of the mentioned
Answer:

Option (b)

17.
For a No preemption condition to prevail ____________
(a) each resource is either currently assigned to exactly one processor is available
(b) the process currently holding resources granted earlier can request more resources
(c) previously granted resources cannot be forcibly taken away from the process
(d) All of the mentioned
Answer:

Option (c)

18.
Resources which can be taken away from a process without causing any ill effects to the process are called _____________
(a) preemptable resources
(b) non-preemptable resources
(c) sharable resources
(d) None of the mentioned
Answer:

Option (a)

19.
Deadlock prevention is a set of methods ____________
(a) to ensure that all of the necessary conditions do not hold
(b) to decide if the requested resources for a process have to be given or not
(c) to recover from a deadlock
(d) to ensure that at least one of the necessary conditions cannot hold
Answer:

Option (d)

20.
For non sharable resources like a printer, mutual exclusion ____________
(a) must not exist
(b) may exist
(c) must exist
(d) None of the mentioned
Answer:

Option (c)

Showing 11 to 20 out of 50 Questions
1 2 3 4 5