there two opertions in the stack?

Question

a)pop,push
b)top,push
c)pop,top
d)top,bottom

Answer 1

pop and push are the two operations...

top and bottom are actually locations where you store elements. we can only access items at the 'top' of the stack. If you want to insert any item, you use the 'push' operation. This will insert the item at the top of the stack. And when you want to retrieve the element at the top of the stack you use 'pop'

Answer 2

option A. pop, and push.
stack is a structure to store data, such a way that last element entered will be the first one if you try to get data.
Operation push means adding the data, in the stack, and pop means taking out the elements.
The operation top is seldom used, which means just getting the value of the top element. There is one more operation named empty, to check if the stack is empty or not.

A sample class representation is

class _stack
{
private :
int a[30];
int index;

public:
_stack();
void push(int);
int pop();
int top();
bool empty();
}

This is the stack which will store the elements of type it.

Answer 3

There isn't a question here.