CUET PG 2025 — Computer PYQ

The question asks to identify the term for a situation where multiple processes are stuck, each waiting for a resource held by another process in the group. Let's analyze the options to understand this concept.

Understanding Process Blocking: Deadlock Explained

In operating systems, processes often need to access shared resources like memory, files, or devices. When multiple processes compete for these resources, specific scenarios can arise that lead to inefficiency or system stalls. The situation described—where two or more processes are blocked indefinitely because each is holding a resource and waiting for another resource acquired by the other—is a well-known problem.

Analyzing the Options

• Option 1: Pooling

  Pooling refers to the practice of grouping resources, such as database connections or threads, so they can be reused efficiently. It aims to reduce the overhead of creating and destroying resources frequently. Pooling does not describe a situation where processes are mutually blocked.

• Option 2: Deadlock

  Deadlock occurs when two or more processes enter into a waiting state because each is holding a resource and waiting for a resource that is held by another process in the same set. This creates a circular dependency. The essential conditions for deadlock are:

  • Mutual Exclusion: At least one resource must be held in a non-sharable mode.
  • Hold and Wait: A process must be holding at least one resource and waiting to acquire additional resources held by other processes.
  • No Preemption: Resources cannot be forcibly taken away from a process; they must be released voluntarily by the process holding them.
  • Circular Wait: A set of waiting processes {P0,P1,...,Pn}{P0​,P1​,...,Pn​} must exist such that P0P0​ is waiting for a resource held by P1P1​, P1P1​ is waiting for a resource held by P2P2​, ..., Pn−1Pn−1​ is waiting for a resource held by PnPn​, and PnPn​ is waiting for a resource held by P0P0​.

  This definition directly matches the scenario described in the question.

• Option 3: Thrashing

  Thrashing is a phenomenon primarily related to virtual memory management. It occurs when a computing system spends more time processing page faults (moving data between RAM and secondary storage) than executing application code. This usually happens when a system lacks sufficient physical memory (RAM) to hold the active working sets of the processes currently running. Thrashing leads to severe performance degradation but is different from the mutual blocking of processes over resource acquisition.

• Option 4: Paging

  Paging is a memory management technique used to implement virtual memory. It involves dividing a computer's memory into fixed-size blocks called pages. This allows processes to use more memory than is physically available by swapping pages between RAM and disk storage. While paging is crucial for memory management, it doesn't describe the specific inter-process blocking situation mentioned.

Conclusion

Based on the definitions, the situation where two or more processes are blocked, waiting for resources held by each other, is precisely termed as a deadlock.