void menu(); int main() { int data[100], n, ch,c, fr = 0, re=0; printf("Enter stack size: "); scanf("%d",&n); menu(); printf("Enter choice: "); scanf("%d",&ch); while(ch != 0) { if(ch == 1) { if(c == n) { printf("Queue full\n\n"); } else { printf("enter data: "); scanf("%d",&data[re]); re = (re+1)%n;
#include<stdio.h>
void menu();
int main()
{
int data[100], n, ch,c, fr = 0, re=0;
printf("Enter stack size: ");
scanf("%d",&n);
menu();
printf("Enter choice: ");
scanf("%d",&ch);
while(ch != 0)
{
if(ch == 1)
{
if(c == n)
{
printf("Queue full\n\n");
}
else
{
printf("enter data: ");
scanf("%d",&data[re]);
re = (re+1)%n;
c++;
}
}
else if(ch == 2)
{
if(c == 0)
{
printf("stack empty\n\n");
}
else
{
printf("%d dequeued\n\n",data[fr]);
fr = (fr+1)%n;
c--;
}
}
else if(ch == 3)
{
if(c>0)
{
printf(" front value : %d\n\n",data[fr]);
}
else
{
printf("stack empty\n\n");
}
}
else if(ch == 4)
{
printf("stack size: %d\n\n",c);
}
else
{
printf("invalid choice\n\n");
}
menu();
printf("Enter choice: ");
scanf("%d",&ch);
}
}
void menu()
{
printf("1. Enqueue\n");
printf("2. Dequeue\n");
printf("3. Top Value\n");
printf("4. Stack Size\n");
printf("0. Exit\n");
}
inplement stack using queue
Step by step
Solved in 3 steps
