Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Multiple Choice Questions
Q691: A philosopher can set state[i] = eating only if _________.
- A: neighbors are eating
- B: both neighbors are not eating
- C: right neighbor is eating
- D: at least one neighbor is eating
View Answer
B
Q692: In resource allocation graphs, nodes represent _______.
- A: only processes
- B: only resources
- C: processes and resources
- D: only CPU states
View Answer
C
Q693: In deadlock prevention, ensuring no circular wait is called _______.
- A: preemption
- B: resource ordering
- C: starvation
- D: mutual exclusion
View Answer
B
Q694: Deadlocks involve processes waiting for ________ held by others.
- A: unused resources
- B: released resources
- C: resources
- D: destroyed resources
View Answer
C
Q695: In the resource allocation graph example, P2 is waiting for which resource?
- A: R1
- B: R2
- C: R3
- D: R4
View Answer
C
Q696: In the deadlock condition "No Preemption", processes _______.
- A: forcibly release resources
- B: release resources voluntarily
- C: never release resources
- D: share resources
View Answer
B
Q697: A resource instance is considered identical if _______.
- A: it cannot be replaced
- B: any instance satisfies a request
- C: it’s the only one
- D: it must be shared
View Answer
B
Q698: How many types of vertices are there in the resource allocation graph?
- A: 1
- B: 2
- C: 3
- D: 4
View Answer
B
Q699: Which is NOT a necessary condition for a deadlock?
- A: Hold and wait
- B: Circular wait
- C: Mutual exclusion
- D: Resource duplication
View Answer
D
Q700: What are the three general methods of handling deadlocks?
- A: Prevention, Avoidance, Recovery
- B: Allocation, Release, Prevention
- C: Holding, Waiting, Release
- D: Communication, Prevention, Resource Sharing
View Answer
A