Operating System (3140702) MCQs

MCQs of Deadlock

Showing 21 to 30 out of 50 Questions
1 2 3 4 5
21.
The disadvantage of a process being allocated all its resources before beginning its execution is ____________
(a) low CPU utilization
(b) low resource utilization
(c) very high resource utilization
(d) None of the mentioned
Answer:

Option (b)

22.
To ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately allocated to it ____________
(a) then the process waits for the resources be allocated to it
(b) the process keeps sending requests until the resource is allocated to it
(c) the process resumes execution without the resource being allocated to it
(d) then all resources currently being held are preempted
Answer:

Option (d)

23.
One way to ensure that the circular wait condition never holds is to ____________
(a) impose a total ordering of all resource types and to determine whether one precedes another in the ordering
(b) to never let a process acquire resources that are held by other processes
(c) to let a process wait for only one resource at a time
(d) All of the mentioned
Answer:

Option (a)

24.
Each request requires that the system consider the _____________ to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.
(a) processes that have previously been in the system
(b) resources currently allocated to each process
(c) future requests and releases of each process
(d) resources currently available
Answer:

Option (d)

25.
A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist.
(a) resource allocation state
(b) system storage state
(c) operating system
(d) resources
Answer:

Option (a)

26.
A state is safe, if ____________
(a) the system does not crash due to deadlock occurrence
(b) the system can allocate resources to each process in some order and still avoid a deadlock
(c) the state keeps the system protected and safe
(d) All of the mentioned
Answer:

Option (b)

27.
A system is in a safe state only if there exists a ____________
(a) safe allocation
(b) safe resource
(c) safe sequence
(d) all of the mentioned
Answer:

Option (c)

28.
A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2. Process P0 holds 5 tape drives, P1 holds 2 and P2 holds 2 tape drives. Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives. Which of the following sequence is a safe sequence?
(a) P0, P1, P2
(b) P1, P2, P0
(c) P2, P0, P1
(d) P1, P0, P2
Answer:

Option (d)

29.
If no cycle exists in the resource allocation graph ____________
(a) then the system will not be in a safe state
(b) then the system will be in a safe state
(c) both A and B
(d) None of the mentioned
Answer:

Option (b)

30.
The data structures available in the Banker’s algorithm are ____________
(a) Available
(b) Need
(c) Allocation
(d) All of the mentioned
Answer:

Option (d)

Showing 21 to 30 out of 50 Questions
1 2 3 4 5