Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Multiple Choice Questions
Q731: The method where resources can be preempted from a process if its request cannot be immediately satisfied is called _______.
- A: No preemption
- B: Hold and Wait
- C: Resource reallocation
- D: Preemption
View Answer
D
Q732: Claim edges in the resource allocation graph are converted to _______ edges when requested.
- A: Assignment
- B: Request
- C: Release
- D: Preemption
View Answer
B
Q733: What new type of edge is introduced in resource allocation graphs for deadlock avoidance?
- A: Request edge
- B: Assignment edge
- C: Claim edge
- D: Allocation edge
View Answer
C
Q734: A dashed line in a resource allocation graph represents a ________.
- A: Request edge
- B: Claim edge
- C: Assignment edge
- D: Cycle
View Answer
B
Q735: A resource request can be granted if converting it to an assignment edge does NOT create a ________.
- A: Request
- B: Claim
- C: Cycle
- D: Process
View Answer
C
Q736: In a resource allocation graph, if a cycle is formed after granting a request, the system becomes ________.
- A: Safe
- B: Unsafe
- C: Deadlock-free
- D: Deadlocked
View Answer
B
Q737: In Banker’s Algorithm, what must a process declare on entering the system?
- A: Available resources
- B: Maximum resources needed
- C: Current allocation
- D: Resource request
View Answer
B
Q738: What matrix in Banker’s Algorithm represents the maximum demand of each process?
- A: Allocation
- B: Need
- C: Max
- D: Available
View Answer
C
Q739: What matrix shows how many instances are currently allocated to each process?
- A: Available
- B: Max
- C: Allocation
- D: Need
View Answer
C
Q740: Need[i,j] is calculated as ________ in Banker’s Algorithm.
- A: Max[i,j] - Allocation[i,j]
- B: Allocation[i,j] + Max[i,j]
- C: Available[j] - Allocation[i,j]
- D: Max[i,j] + Available[j]
View Answer
A