Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Multiple Choice Questions
Q761: The system is in safe state if:
- A: There is a cycle
- B: No safe sequence exists
- C: Safe sequence exists
- D: Resources are over-allocated
View Answer
C
Q762: If Available[j] = 3, it means there are ________ available instances of resource Rj.
- A: 2
- B: 3
- C: 4
- D: 5
View Answer
B
Q763: If Need[i][j] = 0 for all j, the process ________.
- A: Still needs resources
- B: Has finished execution
- C: Is waiting
- D: Cannot finish
View Answer
B
Q764: When Pi requests Rj, the claim edge Pi → Rj is converted to ________.
- A: Assignment edge
- B: Request edge
- C: Release edge
- D: Max edge
View Answer
B
Q765: What represents the current allocation of resources in Banker’s Algorithm?
- A: Max matrix
- B: Available vector
- C: Allocation matrix
- D: Need matrix
View Answer
C
Q766: The safe sequence < P1, P3, P4, P0 > ensures that:
- A: Deadlock occurs
- B: Resources are wasted
- C: All processes finish
- D: Unsafe state is reached
View Answer
C
Q767: Process P1 requests (1,0,2) resources. The system must first check against ________.
- A: Allocation
- B: Available
- C: Need
- D: Max
View Answer
B
Q768: What is the purpose of a deadlock detection algorithm?
- A: To allocate resources
- B: To detect deadlocks in the system
- C: To prevent deadlocks
- D: To increase resource usage
View Answer
B
Q769: In a wait-for graph, an edge from Pi to Pj means ______.
- A: Pi is executing Pj
- B: Pi is waiting for Pj to release a resource
- C: Pj is waiting for Pi to release a resource
- D: Pj is executing Pi
View Answer
B
Q770: In a wait-for graph, a deadlock exists if and only if ______.
- A: All processes are finished
- B: No process is waiting
- C: The graph contains a cycle
- D: Resources are free
View Answer
C