Stack/Queue Review

Front

The concept of data enters the stack is ____________________

Back

LIFO

Front

Process of inserting an element in the stack is called ...

Back

Push

Front

Process of Removing element from the stack is called ...

Back

Pop

Front

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

Back

Underflow of Stack

Front

User push 1 element in the stack having already five elements and having stack size as 5 then stack becomes ___________.

Back

Overflow

Front

User perform following above operations on stack of size 5 then, at the end of last operation, total number of elements present in the stack are ________________

Back

1

Front

In order to keep track of current topmost element of the stack we need to maintain one variable.

Back

Yes

Front

In this implementation of stack maximum value of top which cannot cause overflow will _________.

Back

9

Front

Select a real life situation implement stack

Back

All of the answers

Front

LIFO stands for

Back

Last in First Out