What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?

Related Questions

• Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation.
• When a stack is organized as an array, a variable named Top is used to point to the top element of the stack. Initially, the value of Top is set to_______to indicate an empty stack.
• Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
• In stack terminology, the __________operations are known as push and pop operations respectively.
• When the push operation is performed on stack the value of TOS will be ______
• Worst space complexity of stack data structure is
• In stack, to display the lastly inserted element without removing it, which function is used?
• What will be the value of top, if there is a size of stack STACK_SIZE is 5
• What will be the value of top, if there is a size of stack STACK_SIZE is 5
• The term "push" and "pop" is related to the