HackerRank Stack Quiz-1

A Stack is an abstract data structure that contains a collection of elements. Stack implements the LIFO(Last In First Out) mechanism i.e. the element that is inserted last is deleted first. And, in a Stack, both, insertion and deletion, is permitted at one end only.

The process of inserting an element in the stack is called push operation. When the stack is full then the overflow condition rises.

The process of deleting an element in the stack is called pop operation. Pop operation deletes the element from the top of the stack.

 This operation returns the topmost item from the stack, peek means that what is the topmost item.

 All the above applications are used in stack .

Union and structure are the special data type that allows to store different data types in the same memory in the stack.

This Underflow condition occurs when we call pop operation on an empty stack.

The process of placing a book on the table and then removing it is the stack operation of pop means LIFO(Last In First Out).

Handling of interruption is a real time system.so these interruptions come under First Come First Serve.

This type of notation is referred to as infix since the operator is in between the two operands that it is working on.