GATE CS 2025 (Afternoon) — Question 48

Operating Systems (OS)Deadlock Prevention, Avoidance, Detection, RecoveryMSQ2 marksMedium

\( P = \{P_1, P_2, P_3, P_4\} \) consists of all active processes in an operating system. \( R = \{R_1, R_2, R_3, R_4\} \) consists of single instances of distinct types of resources in the system. The resource allocation graph has the following assignment and claim edges. Assignment edges: \( R_1 \rightarrow P_1, R_2 \rightarrow P_2, R_3 \rightarrow P_3, R_4 \rightarrow P_4 \) (the assignment edge \( R_1 \rightarrow P_1 \) means resource \( R_1 \) is assigned to process \( P_1 \), and so on for others) Claim edges: \( P_1 \rightarrow R_2, P_2 \rightarrow R_3, P_3 \rightarrow R_1, P_2 \rightarrow R_4, P_4 \rightarrow R_2 \) (the claim edge \( P_1 \rightarrow R_2 \) means process \( P_1 \) is waiting for resource \( R_2 \), and so on for others) Which of the following statement(s) is/are CORRECT?
  1. A
    Aborting \( P_1 \) makes the system deadlock free.
  2. B
    Aborting \( P_3 \) makes the system deadlock free.
  3. C
    Aborting \( P_2 \) makes the system deadlock free.
  4. D
    Aborting \( P_1 \) and \( P_4 \) makes the system deadlock free.
Practise the full 2025-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkOperating System Concepts (Galvin)Scheduling, synchronisation, deadlocks, memory and file systems.
Practise more on Deadlock Prevention, Avoidance, Detection, RecoveryTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group