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

• Underflow

• Empty collection

• Overflow

• Garbage Collection

Process of inserting an element in stack is called ____________

• Create

• Push

• Evaluation

• Pop

User perform following operations on stack of size 5 then -

push(1);

pop();

push(2);

push(3);

pop();

push(2);

pop();

pop();

push(4);

pop();

pop();

push(5);

• Overflow Occurs

• Stack Operations will be performed Smoothly

• Underflow Occurs

• None of these

Which one of the following is an application of Stack Data Structure?

• Managing function calls

• The Knight-Tour problem

• Maze Problem

• All of the above

List of data in which element can be inserted and removed at the same end is called as __________.

• array

• stack

• linked list

• queue

Which of the following is not an application of stack?

• Job scheduling

• Undo-redo feature

• Balancing of symbols

• Tower of hanoi

The stack uses which policy out of the following

• LIFO

• FIFO

• FILO

• NONE

An array elements are always stored in ________ memory locations.

• sequential

• Random

• Sequential and Random

• None of the above

Select operations that can be performed on a stack Data Structure...

• isEmpty()

• pop()

• push()

• isFull()

A stack is a data structure in which elements

• can be added to any position and removed only from the top

• can be only added to the top and removed from any position

• can be added and removed from the top only

• can be added and removed from any position