Stack ADT

Process of adding an element to a stack is

• Create

• Push

• Evaluation

• Pop

Process of removing an element from the stack

• Create

• Push

• Evaluation

• Pop

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

• Underflow

• Empty Collection

• Overflow

• Garbage Collection

Pushing an element into a stack already having six elements and the size is six, then the stack has

• Overflow

• Crash

• Underflow

• User flow

Stack Data Structure is

• FIFO

• None of these

• LILO

• LIFO

Consider the following function where Max is the maximum amount of elements in a stack

Procedure Demo(newItem)

Begin

If topValue = Max then

print "It is full"

else

topValue = topValue + 1

Stack(topValue) = newItem

End Procedure

The algorithm above is designed to show how

• values are popped off a stack

• values are pushed into a stack

• top values can be replaced

• values can be replaced in a stack

LEMON     ----- Top
ROSE
CARROT
CORN
TULIP

After three POP operations have been performed on the above stack, the three items, in order, which will be taken out of the stack are

• LEMON, ROSE, CARROT

• ROSE, CARROT, CORN

• TULIP, CORN, CARROT

• CARROT, CORN, TULIP

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

Which of the following statements is a specification of a set of data and the set of operations that can be performed on the data?

• Library

• ADT

• Package

• Tracer