What is the stack algorithm to push an item?

Answer 1

Stack Data Structure
1.It is a Linear Data Structure.


2.In which a data item is inserted & deleted at one end.


3.It is a Last In - First Out (LIFO) Data Structure where the data item is inserted last into the stack is the first data item to be deleted from the stack.
NOTE:


Please refer to http://www.cosc.canterbury.ac.nz/mukundan/dsal/StackAppl.html site to understand the concept of stack using java applet.


Just Copy & Paste it in your browser,but you need a Java RunTime Environment(JRE) installed onto your PC.
4.Writting a value to stack is push operation.


5.Reading a value from the stack is pop operation.


6.Once an item is popped from the stack,it is no longer available.
Algorithm
1.push operation:
if top of the stack is greater than equal to maximum number of entries into the stack,
then print "Stack is already full.Cannot add more items."
top of stack = t
increment the top of the stack


2.pop operation:
decrement top of the stack
if top <0,then print "Stack is already empty.Noitems to read."


3.call these push & pop functions declared void in the main function using the switch statement.


4.The variable top & symbolic constant stack maximum items entry number has to be declared.

Answer 2

The Stack is a last-in first-out (LIFO) data structure. It is characterized by 2 operations:

push: add element to top of stack

pop: remove element from top of stack

A good way to remember this is with those pop can compartments in fridges. The last "pop" you added is the first pop you get (and with a pop operation ;)). You add a pop to the fridge by pushing it into the compartment (and at the top of the compartment too).

Answer 3

#include
void push(int);
int pop(void);
void display(void);

int main()
{
int choice=0,val=0;
do
{
printf("\n\t1.Push 2.Pop 3.Display 4.Exit\n\tSelect Your Choice : ");
scanf("%d",&choice);
switch(choice)
{
case 1:
printf("\tElement to be Pushed : ");
scanf("%d",&val);
push(val);
break;
case 2:
val=pop();
if(val!=-1)
printf("\tPopped Element : %d\n",val);
break;
case 3:
display();
break;
case 4:
break;
default:
printf("\tWrong Choice");
break;
}
}while(choice!=4);
return 0;
}
#define maxsize 100
int stack[maxsize];
int stacktop=0;

void push(int val)
{
if(stacktopstack[stacktop++]=val;
else
printf("Stack Overflow");
}

int pop()
{
int a;
if(stacktop>0)
{
stacktop--;
a=stack[stacktop];

return a;
}
else
{
printf("Stack is Empty");
return -1;
}
}

void display()
{
int i=0;
if(stacktop>0)
{
printf("\tElements are:");
while(i{
printf("\t%d",stack[i++]);
}
printf("\n");
}

else
printf("\tStack is Empty\n");
}

Answer 4

what is stack