Computer Science · Operating Systems
Match the Deadlock Detection Data Structures and Tools in LIST-I with their corresponding Definition or Meaning in LIST-II: LIST-I (Data Structure/Tool) A. Available[m] B. Allocation[n][m] C. Request[n][m] D. Wait-for Graph (WFG) LIST-II (Definition/Meaning) I. Number of resources of each type currently held by each process II. Graph representation used for single-instance resource systems III. Number of available free resources of each type in the system IV. Current pending resource requests of each process Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A-I, B-III, C-II, D-IV
- 2A-III, B-IV, C-I, D-II
- 3A-III, B-I, C-IV, D-II✓
- 4A-II, B-I, C-IV, D-III
Correct answer
A-III, B-I, C-IV, D-II
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