C Program for Multi Queue

Program-

// c program for multi Queue
#include<stdio.h>
#define MAX 10

struct s
{
int queue[10];
int rear,front;

}red,green,blue;

void insert(int);
void del(int);
void show();


void main()
{

int ch;
int temp;
red.rear=green.rear=blue.rear=0;
red.front=green.front=blue.front=0;

do
{
printf("\n\t Main menu");
printf("\n 1:Insert in red");
printf("\n 2:Insert in green");
printf("\n 3:Insert in blue");
printf("\n 4:Delete From red");
printf("\n 5:Delete From green");
printf("\n 6:Delete From blue");
printf("\n 7:Show");
printf("\n 8:Exit");
printf("\n Enter Your Choice ");
scanf("%d",&ch);
switch(ch)
{
case 1: insert(1); break;
case 2: insert(2); break;
case 3: insert(3); break;
case 4: del(4); break;
case 5: del(5); break;
case 6: del(6); break;
case 7: show(); break;
case 8: temp=1; break;
default: printf("\n wrong choice");
}
}while(ch!=8 && temp!=1);
}

void insert(int no)
{
int item;
if(no==1)
{
if(red.rear==MAX)
printf("\n overflow");
else
{
printf("\n Enter the value ");
scanf("%d",&item);
red.queue[red.rear]=item;
red.rear++;
}
}
if(no==2)
{
if(green.rear==MAX)
printf("\n overflow");
else
{
printf("\n Enter the value ");
scanf("%d",&item);
green.queue[green.rear]=item;
green.rear++;
}
}
if(no==3)
{
if(blue.rear==MAX)
printf("\n overflow");
else
{
printf("\n Enter the value ");
scanf("%d",&item);
blue.queue[blue.rear]=item;
blue.rear++;
}
}
}

void del(int no)
{
int item,i;
if(no==4)
{
if(red.front==red.rear)
printf("\n Underflow");
else
{
item=red.queue[red.front];
printf("\n Deleted element is %d",item);
red.front++;
}
}
if(no==5)
{
if(green.front==green.rear)
printf("\n Underflow");
else
{
item=green.queue[green.front];
printf("\n Deleted element is %d",item);
green.front++;
}
}
if(no==6)
{
if(blue.front==blue.rear)
printf("\n Underflow");
else
{
item=blue.queue[blue.front];
printf("\n Deleted element is %d",item);
blue.front++;
}
}
}

void show()
{
int i;
if(red.front==red.rear)
printf("\n red queue is empty");
else
{
printf("\n Elements of Red queue are \n");
for(i=red.front;i<red.rear;i++)
{
printf("%d\t",red.queue[i]);
}
}

if(green.front==green.rear)
printf("\n green queue is empty");
else
{
printf("\n Elements of green queue are \n");
for(i=green.front;i<green.rear;i++)
{
printf("%d\t",green.queue[i]);
}
}


if(blue.front==blue.rear)
printf("\n blue queue is empty");
else
{
printf("\n Elements of blue queue are \n");
for(i=blue.front;i<blue.rear;i++)
{
printf("%d\t",blue.queue[i]);
}
}
}


Output-


         Main menu
 1:Insert in red
 2:Insert in green
 3:Insert in blue
 4:Delete From red
 5:Delete From green
 6:Delete From blue
 7:Show
 8:Exit
 Enter Your Choice 1

 Enter the value 10

         Main menu
 1:Insert in red
 2:Insert in green
 3:Insert in blue
 4:Delete From red
 5:Delete From green
 6:Delete From blue
 7:Show
 8:Exit
 Enter Your Choice 1

 Enter the value 20

         Main menu
 1:Insert in red
 2:Insert in green
 3:Insert in blue
 4:Delete From red
 5:Delete From green
 6:Delete From blue
 7:Show
 8:Exit
 Enter Your Choice 1

 Enter the value 30

         Main menu
 1:Insert in red
 2:Insert in green
 3:Insert in blue
 4:Delete From red
 5:Delete From green
 6:Delete From blue
 7:Show
 8:Exit
 Enter Your Choice 2

 Enter the value 100

         Main menu
 1:Insert in red
 2:Insert in green
 3:Insert in blue
 4:Delete From red
 5:Delete From green
 6:Delete From blue
 7:Show
 8:Exit
 Enter Your Choice 2

 Enter the value 200

         Main menu
 1:Insert in red
 2:Insert in green
 3:Insert in blue
 4:Delete From red
 5:Delete From green
 6:Delete From blue
 7:Show
 8:Exit
 Enter Your Choice 7

 Elements of Red queue are
10      20      30
 Elements of green queue are
100     200
 blue queue is empty
         Main menu
 1:Insert in red
 2:Insert in green
 3:Insert in blue
 4:Delete From red
 5:Delete From green
 6:Delete From blue
 7:Show
 8:Exit
 Enter Your Choice 4

 Deleted element is 10
         Main menu
 1:Insert in red
 2:Insert in green
 3:Insert in blue
 4:Delete From red
 5:Delete From green
 6:Delete From blue
 7:Show
 8:Exit
 Enter Your Choice 7

 Elements of Red queue are
20      30
 Elements of green queue are
100     200
 blue queue is empty
         Main menu
 1:Insert in red
 2:Insert in green
 3:Insert in blue
 4:Delete From red
 5:Delete From green
 6:Delete From blue
 7:Show
 8:Exit

Enter Your Choice 8