Computer Science · Deadlock Detection
Consider the following statements regarding Deadlock Detection in operating systems: Statement 1: A Wait-for Graph (WFG) is a simplified Resource Allocation Graph (RAG) containing only process nodes. Statement 2: A cycle in a Wait-for Graph strictly indicates a deadlock in a system with single-instance resources.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Only Statement 1 is true
- 2Both statements are true✓
- 3Only Statement 2 is true
- 4Both statements are false
Correct answer
Both statements are true
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 Deadlock Detection MCQs →Want more practice questions on Deadlock Detection?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Deadlock Detection