Stack Operations

#include<stdio.h>

#include<conio.h>

int
q[100];

int
ch,item,n,front=1,rear=0,top=0;

void
pop();

void
push();

void
display();

void main()

{

char
con;

clrscr();

printf("\n\t\t
STACK OPERATION");

printf("\n\t\t~~~~~~~~~~~~~~~");

printf("\n\nEnter
the size of stack:");

scanf("%d",&n);

printf("\n\n");

do

{

printf("\n1.add");

printf("\n2.del");

printf("\n3.display");

printf("\n4.exit");

printf("\nEnter
your choice:");

scanf("%d",&ch);

switch(ch)

{

case
1:

if(rear==n)

printf("\n
Queue is full");

else

{

printf("\nEnter
the item=");

rear++;

scanf("%d",&q[rear]);

}

break;

case
2:

if(front==rear)

printf("\nQueue
is empty");

else

{

item=q[front];

printf("\nDeleted
item is=%d",item);

front++;

}

break;

case
3:

{

display();

break;

}

}

}while(ch<=3);

getch();

} /*

void addq()

{

int i;

if(front==rear)

printf("\n Queue is
full");

else

{

for(i=rear;i>=front;i--)

q[i]=q[i-1];

printf("\nEnter the item=");

scanf("%d",&q[front]);

}

}

void delq()

{

if(front==rear)

printf("\nQueue is empty");

else

{

item=q[front];

printf("\nDeleted item is=%d",item);

front++;

}

} */

void
display()

{

int i;

if(front==rear)

printf("\nQueue
is empty");

else

{

printf("\nThe
values are");

for(i=front;i<rear+1;i++)

printf("\n
%d",q[i]);

}

}