C Programs

C Data Structure Programs

Queue Implementation Using Array

DS - Queue Implementation Using Array


	#include <stdio.h>
	#include <string.h>
	#include <stdlib.h>
	#include <stdbool.h>

	#define MAX 6

	int queue[MAX];
	int front = -1;
	int rear = -1;
	int val;

	int main()
	{
		int ch;
		while(1)
		{
			printf("\n");
			printf("\n\n 1. Insert \n 2. Delete \n 3. Display\n 4. Exit\n\n");
			printf("Enter option : ");
			scanf("%d",&ch);
		switch(ch)
		{
		case 1:
			if(rear==MAX-2 )
			{
			   printf("Queue Overflow... Delete all data to insert newly\n");
			   break;
			}
			printf("Enter the data to insert : ");
			scanf("%d",&val);
			insert(val);
			break;
		case 2:
			if(rear==-1)
			{
				printf("Queue is Empty\n");
				break;
			}
			delete();
			break;
		case 3:
			printf("\n");
			display();
			break;
		case 4:
			exit(0);
		default:
			printf("Wrong Option\n\n");
		}
	    }
	}

	int insert(int val)
	{
		if(front==-1)
		{
			rear=front=0;
			queue[rear]=val;
		}
		else
		{
			rear=rear+1;
			queue[rear]=val;
		}
		printf("%d is inserted succesfully\n\n",val);
		display();
		printf("\n");
	}

	int delete()
	{
		printf("%d is deleted\n\n",queue[front]);
		if(front==rear)
		{
			front=rear=-1;
			return;		
		}
		front++;
		display();
	}

	int display()
	{
		int temp=front;
		int t=temp;
		if(front==-1)
		{
			printf("Queue is Empty\n");	
			return;
		}
		else
		{
		// Printing the top line
			printf("\n");
			printf("     ");
			for(t;t<=rear;t++)
			{
				printf("------");
			}
			printf("\n");
		
		// printing the element	
			printf("     ");
			for(front;front<=rear;front++)
				printf(" %d <-",queue[front]);
				front=temp;
				
			printf("\n");
		
		// printing the bottom line	
			printf("     ");
			for(t=temp;t<=rear;t++)
			{
				printf("------");
			}
			printf("\n");	
		}
		printf("\n");
	}

C Programs

C Data Structure Programs

 Home

C Data Structure Programs

Queue Implementation Using Array

DS - Queue Implementation Using Array

If you have any queries please email us at info@motionzen.com