Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Chapter: 27
Q701:
Which method ensures that deadlocks never occur by preventing one of the necessary conditions?
A. Deadlock avoidance
B. Deadlock prevention
C. Deadlock detection
D. Deadlock recovery
Correct Answer:
B
Chapter: 27
Q702:
Deadlock avoidance requires _______ information from processes.
A. Prior
B. No
C. Future
D. Immediate
Correct Answer:
C
Chapter: 27
Q703:
In deadlock prevention, to avoid hold and wait, a process must request all resources _______.
A. After starting execution
B. Before starting execution
C. After release of first resource
D. During deadlock
Correct Answer:
B
Chapter: 27
Q704:
Mutual exclusion is required for _______ resources.
A. Sharable
B. Read-only
C. Non-sharable
D. Volatile
Correct Answer:
C
Chapter: 27
Q705:
Read-only files are considered _______ resources.
A. Non-sharable
B. Sharable
C. Temporary
D. Dynamic
Correct Answer:
B
Chapter: 27
Q706:
If a process requests a resource and it is not available, and all currently held resources are released, which method is applied?
A. Hold and wait
B. Preemption
C. Starvation
D. Circular wait
Correct Answer:
B
Chapter: 27
Q707:
Circular wait can be prevented by _______.
A. Allowing multiple holds
B. Using random resource requests
C. Total ordering of resources
D. Starving all processes
Correct Answer:
C
Chapter: 27
Q708:
In total ordering, resources must be requested in _______ order.
A. Increasing
B. Decreasing
C. Random
D. Simultaneous
Correct Answer:
A
Chapter: 27
Q709:
A _______ state means the system can allocate resources without causing deadlocks.
A. Deadlock
B. Unsafe
C. Safe
D. Circular
Correct Answer:
C
Chapter: 27
Q710:
In deadlock prevention, resource utilization may be _______.
A. Optimal
B. Low
C. Balanced
D. Predictable
Correct Answer:
B
Chapter: 27
Q711:
Starvation is a possible side effect of _______ protocols.
A. Hold and Wait elimination
B. Preemption
C. Circular wait
D. Deadlock avoidance
Correct Answer:
A
Chapter: 27
Q712:
If a system is in a safe state, then deadlock is _______.
A. Certain
B. Possible
C. Impossible
D. Immediate
Correct Answer:
C
Chapter: 27
Q713:
The resource allocation graph uses _______ edges to represent potential future requests.
A. Request
B. Assignment
C. Claim
D. Release
Correct Answer:
C
Chapter: 27
Q714:
Claim edges are represented by _______ lines.
A. Solid
B. Dashed
C. Dotted
D. Double
Correct Answer:
B
Chapter: 27
Q715:
If a process requests resources only when it has none, it is following which protocol?
A. Preemption protocol
B. Mutual exclusion protocol
C. Hold and wait elimination
D. Safe state protocol
Correct Answer:
C
Chapter: 27
Q716:
Deadlock recovery allows the system to enter deadlock and then _______.
A. Ignore it
B. Detect and recover
C. Shutdown
D. Restart
Correct Answer:
B
Chapter: 27
Q717:
In deadlock prevention, denying mutual exclusion is _______ for non-sharable resources.
A. Possible
B. Impossible
C. Optional
D. Easy
Correct Answer:
B
Chapter: 27
Q718:
The _______ condition must be prevented to avoid circular wait.
A. Mutual exclusion
B. Hold and wait
C. No preemption
D. Circular wait
Correct Answer:
D
Chapter: 27
Q719:
What is the first step when a resource request leads to unsafe state?
A. Accept request
B. Deny request
C. Preempt process
D. Restart process
Correct Answer:
B
Chapter: 27
Q720:
The system must avoid entering an _______ state to prevent deadlocks.
A. Safe
B. Unsafe
C. Preempted
D. Requested
Correct Answer:
B