Computer Science · Operating Systems
Consider the following statements about deadlocks in Operating Systems: (a) The existence of a cycle in a Resource-Allocation Graph with single-unit resources is a necessary and sufficient condition for deadlock. (b) The existence of a cycle in a Wait-For Graph (for single-unit resource types) indicates deadlock. (c) Mutual exclusion, hold and wait, no preemption, and circular wait conditions must occur simultaneously for a deadlock to exist. Mark the correct option:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1All (a), (b), and (c) are correct✓
- 2Only (a) and (c) are correct
- 3Only (c) is correct
- 4Only (b) is correct
Correct answer
All (a), (b), and (c) are correct
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Operating Systems MCQs →Want more practice questions on Operating Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Operating Systems