Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Multiple Choice Questions
Q671: Deadlock can occur if the system has ________.
- A: a cycle in resource allocation graph
- B: no cycles
- C: starved processes
- D: completed processes
View Answer
A
Q672: In resource allocation graph, a directed edge from Pi to Rj means ________.
- A: Pi is using Rj
- B: Pi released Rj
- C: Pi requested Rj
- D: Pi blocked Rj
View Answer
C
Q673: The deadlock problem occurs when ________.
- A: all processes complete execution
- B: processes wait indefinitely for resources
- C: processes release resources early
- D: processes do not request resources
View Answer
B
Q674: How many instances are there of resource type R2 in the given example?
- A: 1
- B: 2
- C: 3
- D: 4
View Answer
B
Q675: Which philosopher states are represented in the enum?
- A: sleeping, hungry, coding
- B: thinking, hungry, eating
- C: requesting, thinking, blocked
- D: waiting, eating, hungry
View Answer
B
Q676: In the monitor dp, which function checks if a philosopher can eat?
- A: pickup()
- B: putdown()
- C: test()
- D: init()
View Answer
C
Q677: Deadlock can happen if processes are stuck in a ________.
- A: simple graph
- B: tree
- C: circular wait
- D: resource pool
View Answer
C
Q678: If no cycles are present in the resource allocation graph, then ________.
- A: deadlock exists
- B: starvation exists
- C: deadlock does not exist
- D: mutual exclusion fails
View Answer
C
Q679: In dining philosophers, philosophers must invoke ________ after eating.
- A: pickup
- B: putdown
- C: wait
- D: signal
View Answer
B
Q680: In deadlock characterization, resources cannot be forcibly removed due to ________.
- A: hold and wait
- B: circular wait
- C: no preemption
- D: mutual exclusion
View Answer
C