In a stack, if a user tries to add an element to a full stack, it is called __________.UnderflowOverflowFull collectionGarbage Collection

The correct term for trying to add an element to a full stack is Overflow.

In data structure terminology, a stack is a collection that follows the Last In, First Out (LIFO) principle, meaning that the last element added is the first one to be removed. When a stack reaches its maximum capacity and a new element is attempted to be pushed onto it, this action causes an overflow condition. This is an important concept in computer science because it helps in managing memory effectively, preventing data corruption and system errors.

To summarize, when a stack is full and an attempt is made to add another element, it results in an Overflow.