Computer Science · Operating Systems
Arrange the following procedural steps of the Deadlock Detection Algorithm for systems with multiple resource instances in the correct sequence of execution: A. Mark the process as Finished (Finish[i] = true). B. Initialize the 'Work' variable to be equal to the current 'Available' resource count. C. Find a process where the current resource 'Request' is less than or equal to 'Work'. D. Update the 'Work' variable by adding the process's current resource 'Allocation' to it. Choose the correct answer from the options given below:
- 1B, D, C, A
- 2B, C, D, A✓
- 3C, B, D, A
- 4B, A, C, D
Correct answer
B, C, D, A
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