Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Chapter: 27
Q721:
In a safe sequence, each process must be able to finish with _______ resources.
A. Future
B. Allocated + Available
C. Shared
D. None
Correct Answer:
B
Chapter: 27
Q722:
Which process order ensures a safe sequence?
A. Any random
B. Based on resource needs
C. Circular sequence
D. Shortest job first
Correct Answer:
B
Chapter: 27
Q723:
If a system has entered an unsafe state, deadlock is _______.
A. Certain
B. Avoided
C. Not possible
D. Ignored
Correct Answer:
A
Chapter: 27
Q724:
The Resource Allocation Graph Algorithm helps in _______.
A. Allowing deadlocks
B. Preventing deadlocks
C. Random allocation
D. Sequential execution
Correct Answer:
B
Chapter: 27
Q725:
System allocates resources after checking available and allocated resources and _______ requests.
A. Past
B. Future
C. Current
D. Previous
Correct Answer:
B
Chapter: 27
Q726:
Circular wait is proved impossible by _______.
A. Holding all resources
B. Mathematical contradiction
C. Allowing preemption
D. Ignoring the problem
Correct Answer:
B
Chapter: 27
Q727:
Deadlock is prevented if processes follow resource requests in _______.
A. Decreasing order
B. Alphabetical order
C. Increasing order
D. No order
Correct Answer:
C
Chapter: 27
Q728:
Deadlock avoidance dynamically examines the _______ state.
A. System shutdown
B. Resource-allocation
C. Request-order
D. CPU scheduling
Correct Answer:
B
Chapter: 27
Q729:
What resource allocation state makes the system unsafe?
A. Deadlock state
B. Starved state
C. Preempted state
D. Circular wait state
Correct Answer:
A
Chapter: 27
Q730:
Which among these is NOT a deadlock handling strategy?
A. Deadlock prevention
B. Deadlock avoidance
C. Deadlock creation
D. Deadlock recovery
Correct Answer:
C
Chapter: 27
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
Correct Answer:
D
Chapter: 27
Q732:
Claim edges in the resource allocation graph are converted to _______ edges when requested.
A. Assignment
B. Request
C. Release
D. Preemption
Correct Answer:
B
Chapter: 28
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
Correct Answer:
C
Chapter: 28
Q734:
A dashed line in a resource allocation graph represents a ________.
A. Request edge
B. Claim edge
C. Assignment edge
D. Cycle
Correct Answer:
B
Chapter: 28
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
Correct Answer:
C
Chapter: 28
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
Correct Answer:
B
Chapter: 28
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
Correct Answer:
B
Chapter: 28
Q738:
What matrix in Banker’s Algorithm represents the maximum demand of each process?
A. Allocation
B. Need
C. Max
D. Available
Correct Answer:
C
Chapter: 28
Q739:
What matrix shows how many instances are currently allocated to each process?
A. Available
B. Max
C. Allocation
D. Need
Correct Answer:
C
Chapter: 28
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]
Correct Answer:
A