Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Multiple Choice Questions
Q771: A system must provide _______ when deadlocks are possible.
- A: Deadlock avoidance only
- B: A deadlock detection and recovery scheme
- C: Only resource preemption
- D: Only process creation
View Answer
B
Q772: What does a wait-for graph remove compared to a resource allocation graph?
- A: Resource nodes
- B: Process nodes
- C: Edges
- D: Cycles
View Answer
A
Q773: If the wait-for graph contains no cycle, then the system is _______.
- A: In deadlock
- B: Safe
- C: Unsafe
- D: Recovering
View Answer
B
Q774: The deadlock detection algorithm for multiple resource instances uses which data structures?
- A: Stack, Queue
- B: Available, Allocation, Request matrices
- C: Tree, Linked list
- D: Graph, Set
View Answer
B
Q775: In the deadlock detection algorithm, the Work vector is initialized to ______.
- A: Request
- B: Allocation
- C: Available
- D: Finish
View Answer
C
Q776: In the deadlock detection algorithm, Finish[i] is set to true if ______.
- A: Allocation[i] is not zero
- B: Allocation[i] is zero
- C: Request[i] is greater than Work
- D: Request[i] is less than Work
View Answer
B
Q777: When Finish[i] is false after algorithm execution, it means ______.
- A: Process Pi has completed
- B: Process Pi is deadlocked
- C: Process Pi is running
- D: Process Pi has preempted resources
View Answer
B
Q778: The system will be in a deadlock state if ______.
- A: Work is greater than Request
- B: Finish[i] == false for some i
- C: Finish[i] == true for all i
- D: Allocation matrix is empty
View Answer
B
Q779: In deadlock detection, what happens if no index i satisfies Finish[i] == false and Requesti ≤ Work?
- A: System is safe
- B: Go to step 4 (check for deadlock)
- C: Allocate more resources
- D: Abort all processes
View Answer
B
Q780: In the provided example, what was the Finish Sequence initially found?
- A:
- B:
- C:
- D:
View Answer
A