In a stack, if a user tries to remove an element from an empty stack, it is called:

Question

Accepted Answer

The correct option is (1):
The fundamental operation for removing an element from a stack, which is governed by the Last-In-First-Out (LIFO) principle, is called **Pop**. When an attempt is made to perform this Pop operation on a stack that currently holds zero elements—that is, it is empty—the resulting error condition is formally known as **Underflow**. This term is crucial in data structures to signify that a requested operation, the removal of data, cannot be executed because the structure is already at its minimum capacity. In programming, checking for an underflow condition is a mandatory step before any Pop operation to ensure program stability and prevent access to invalid memory locations.

The incorrect option is (2):
Empty collection is a simple descriptive state, not the technical name for the error that occurs when an element is removed from a stack in this state. A stack is an 'empty collection' when its size is zero, but the specific failure of the *Pop* operation in this context requires the precise term 'Underflow'. Using 'Empty collection' would fail to communicate the critical nature of the operational error that needs to be handled by the program logic.

The incorrect option is (3):
Overflow is the opposite error condition to Underflow in the context of data structures like stacks. This error occurs when a user attempts to perform a **Push** operation—which is the act of adding a new element—onto a stack that has already reached its maximum, predefined storage capacity. In a physical or virtual memory model, Overflow signifies a memory boundary violation. Therefore, it is strictly associated with insertion failure on a full stack, not removal failure on an empty stack.

The incorrect option is (4):
Garbage collection is a form of automatic memory management used in languages such as Java, C\#, and Python. Its system-level function is to periodically identify and reclaim memory spaces that are no longer referenced or needed by the program, thereby preventing memory leaks. This process is entirely separate from the logical data structure errors that govern stack operations. It is an internal housekeeping mechanism and has no direct relationship to the failure of a Pop operation on an empty stack.