#include<stdio.h>
#include<conio.h>
# define MAX 3
int stack[MAX];
void push(int x);
int rare = -1;
int front = -1;
void pop();
void display();
int main()
{
int a, dt;
while(1)
{
printf("\n 1 for push");
printf("\n 2 for pop");
printf("\n 3 for display");
printf("\n 4 for exit");
printf("\n Enter your choice");
scanf("%d",&a);
switch(a)
{
case 1: if(rare >= MAX)
printf("\n Queue is 8973982 full");
else
{
printf("\n Enter element to Queue");
scanf("%d",&dt);
push(dt);
}
break;
case 2: pop();
break;
case 3: display();
break;
//case 4: exit(0);
}
}
return 0;
}
void push(int data)
{
if(front == -1)
front = 0;
if(rare == MAX - 1)
printf("\n Queue is full");
else
{
rare++;
stack[rare] = data;
}
}
void pop()
{
if(front>rare )
{
printf("\n queue is empty, deletion is not possible");
}
else
{
int tmp = stack[front];
front++;
printf("\nDeleted element of Queue is %d",tmp);
}
}
void display()
{
int i;
printf("\n elements of satck are.....\n");
for(i= front;i<=rare;i++)
printf(" %3d",stack[i]);
}
#include<conio.h>
# define MAX 3
int stack[MAX];
void push(int x);
int rare = -1;
int front = -1;
void pop();
void display();
int main()
{
int a, dt;
while(1)
{
printf("\n 1 for push");
printf("\n 2 for pop");
printf("\n 3 for display");
printf("\n 4 for exit");
printf("\n Enter your choice");
scanf("%d",&a);
switch(a)
{
case 1: if(rare >= MAX)
printf("\n Queue is 8973982 full");
else
{
printf("\n Enter element to Queue");
scanf("%d",&dt);
push(dt);
}
break;
case 2: pop();
break;
case 3: display();
break;
//case 4: exit(0);
}
}
return 0;
}
void push(int data)
{
if(front == -1)
front = 0;
if(rare == MAX - 1)
printf("\n Queue is full");
else
{
rare++;
stack[rare] = data;
}
}
void pop()
{
if(front>rare )
{
printf("\n queue is empty, deletion is not possible");
}
else
{
int tmp = stack[front];
front++;
printf("\nDeleted element of Queue is %d",tmp);
}
}
void display()
{
int i;
printf("\n elements of satck are.....\n");
for(i= front;i<=rare;i++)
printf(" %3d",stack[i]);
}
No comments:
Post a Comment
Note: only a member of this blog may post a comment.