Questions and answers for exam Preparation

MCQs

Total Questions : 21 | Page 1 of 3 pages

Question 1. To ensure that the hold and wait condition never occurs in the system, it must be ensured that :

whenever a resource is requested by a process, it is not holding any other resources
each process must request and be allocated all its resources before it begins its execution
a process can request resources only when it has none
All of these

Discuss Question

Answer: Option D. -> All of these

c “ A process may request some resources and use them. Before it can can request any additional resources, however it must release all the resources that it is currently allocated.

Question 2. For non sharable resources like a printer, mutual exclusion :

must exist
must not exist
may exist
None of these

Discuss Question

Answer: Option A. -> must exist

A printer cannot be simultaneously shared by several processes.

Question 3. For sharable resources, mutual exclusion :

is required
is not required
None of these

Discuss Question

Answer: Option B. -> is not required

They do not require mutually exclusive access, and hence cannot be involved in a deadlock.

Question 4. The disadvantage of a process being allocated all its resources before beginning its execution is :

Low CPU utilization
Low resource utilization
Very high resource utilization
None of these

Discuss Question

Answer: Option B. -> Low resource utilization

None.

Question 5. To ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately allocated to it :

then the process waits for the resources be allocated to it
the process keeps sending requests until the resource is allocated to it
the process resumes execution without the resource being allocated to it
then all resources currently being held are preempted

Discuss Question

Answer: Option D. -> then all resources currently being held are preempted

None.

Question 6. What is the reusable resource?

that can be used by one process at a time and is not depleted by that use
that can be used by more than one process at a time
that can be shared between various threads
none of the mentioned

Discuss Question

Answer: Option A. -> that can be used by one process at a time and is not depleted by that use

None.

Question 7. Which of the following condition is required for deadlock to be possible?

mutual exclusion
a process may hold allocated resources while awaiting assignment of other resources
no resource can be forcibly removed from a process holding it
all of the mentioned

Discuss Question

Answer: Option D. -> all of the mentioned

None.

Question 8. The circular wait condition can be prevented by:

defining a linear ordering of resource types
using thread
using pipes
all of the mentioned

Discuss Question

Answer: Option A. -> defining a linear ordering of resource types

None.

Question 9. A system is in the safe state if:

the system can allocate resources to each process in some order and still avoid a deadlock
there exist a safe sequence
both (a) and (b)
none of the mentioned

Discuss Question

Answer: Option C. -> both (a) and (b)

None.

Question 10. Which one of the following is the deadlock avoidance algorithm?