#include <stdio.h>
#include <stdlib.h>
#define LIMIT 100

int queue[LIMIT];
int front, rear;
int i;
int choice;

void insert();
void delet();
void display();

int main()
{
printf("FIFO TEST\n\n");
front = rear = -1;
do
{

	printf("1. Insert\n2. Delete\n3. Display\n4. Exit\n\n");
	xil_printf("Enter your choice:");
	scanf("%d",&choice);

	switch(choice)
		{
		case 1:
			insert();
			break;
		case 2:
			delet();
			break;
		case 3:
			display();
			break;
		case 4:
			exit(0);
			break;
		default:
			printf("Sorry, invalid choice!\n");
			break;
		}
	} while(choice!=4);
return 0;
}

void insert()
	{
		int element;
		if (rear == LIMIT - 1)
			xil_printf("Queue Overflow\n");
		else
		{
			if (front == - 1)
				front = 0;
			xil_printf("Enter the element to be inserted in the queue: ");
			scanf("%d", &element);
			rear++;
			queue[rear] = element;
		}
}

void delet()
	{
		if (front == - 1 || front > rear)
		{
			xil_printf("Queue Underflow \n");
		}
		else
		{
			xil_printf("The deleted element in the queue is: %d\n", queue[front]);
			front++;
		}
}

void display()
{
	int i;
	if (front == - 1)
{
		xil_printf("Queue underflow\n");
	}
else
		{
		xil_printf("The elements of the queue are:\n");
		for (i = front; i <= rear; i++)
			xil_printf("%d\n", queue[i]);
}
}