Computer Science · Operating Systems
Which of the following statements is TRUE with respect to deadlocks in operating systems?
- 1In a resource-allocation graph, if every edge is an assignment edge, the system must be in a deadlock state.
- 2If the current allocation of resources to processes leads the system to an unsafe state, then a deadlock will necessarily occur.
- 3In a system where each resource has multiple instances, a cycle in the resource-allocation graph indicates the definitive presence of a deadlock.
- 4Circular wait is a necessary condition for the formation of a deadlock.✓
Correct answer
Circular wait is a necessary condition for the formation of a deadlock.
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!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
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