Aim:

Write a program that implement Queue(its operations) using Array

Solution :

C Program to implement Queue (its operations) using Array

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

#define MAX_SIZE 5

int queue[MAX_SIZE],front=-1, rear=-1;

// Function to add an element to the queue
void enqueue(int element) 
{
    if (rear == MAX_SIZE - 1) 
	{
        printf("Queue Overflow\n");
    } 
	else 
	{
		if(front == -1) 
			front = 0;
		queue[++rear] = element;
    }
}

// Function to remove an element from the queue
int dequeue() 
{
	int item;
    if (front == -1) 
	{
		printf("Queue Underflow\n");
        return -1; // Indicating underflow
    } 
	else 
	{
        int item = queue[front++];
        if (front > rear)   // Queue is now empty
		{ 
            front = -1;
            rear = -1;
        } 
        return item;
    }
}

// Function to display all the items from Queue
void display()
{
    int i;
    if (front == -1) 
	{
		printf("Queue is Empty\n");
    } 
    else
    {
        for(i=front;i<=rear;i++)
            printf("%d\t",queue[i]);
    }
}

// Main function
int main() {
    int ch,data;
    do{
        printf("\n1. Insert\n2. Delete\n3. Display\n4. Exit");
        printf("\nEnter your choice:   ");
        scanf("%d",&ch);
        switch(ch)
        {
            case 1: printf("Enter data to insert:  ");
                    scanf("%d",&data);
                    enqueue(data);
                    break;
            case 2: printf("Deleted: %d\n", dequeue());
                    break;
            case 3: display();
                    break;
            case 4: break;
            default: printf("your choice is wrong!..");
        }
    }while(ch!=4);
    return 0;
}

1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   1
Enter data to insert:  10
1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   1
Enter data to insert:  20
1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   1
Enter data to insert:  30
1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   3
10	20	30	
1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   1
Enter data to insert:  40
1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   1
Enter data to insert:  50
1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   3
10	20	30	40	50	
1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   1
Enter data to insert:  60
Queue Overflow

1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   2
Deleted: 10

1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   2
Deleted: 20

1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   2
Deleted: 30

1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   3
40	50	
1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   2
Deleted: 40

1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   2
Deleted: 50

1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   2
Queue Underflow
Deleted: -1

1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   3
Queue is Empty

1. Insert
2. Delete
3. Display
4. Exit
Enter your choice:   4

Related Content :

Data Structures Lab Programs

1) Write a program that uses functions to perform the following operations on singly linkedlist.:
i) Creation ii) Insertion iii) Deletion iv) Traversal View Solution

2) Write a program that uses functions to perform the following operations on doubly linkedlist.:
i) Creation ii) Insertion iii) Deletion iv) Traversal View Solution

3) Write a program that uses functions to perform the following operations on circular linkedlist.:
i) Creation ii) Insertion iii) Deletion iv) Traversal View Solution

4) Write a program that implement Stack (its operations) using Array View Solution

5) Write a program that implement Stack (its operations) using Linked List (Pointer) View Solution

6) Write a program that implement Queue(its operations) using Array View Solution

7) Write a program that implement Queue (its operations) using Linked List (Pointer) View Solution

8) Write a program that implements Quick sort sorting methods to sort a given list of integers in ascending order View Solution

9) Write a program that implements Merge sort sorting methods to sort a given list of integers in ascending order View Solution

10) Write a program that implements Heap sort sorting methods to sort a given list of integers in ascending order View Solution

11) Write a program to implement the tree traversal methods using Recursive View Solution

12) Write a program to implement the tree traversal methods using Non Recursive View Solution

13) Write a program to implement Binary Search Tree (its operations) View Solution

14) Write a program to implement AVL Tree (its operations) View Solution

15) Write a program to implement Red - Black Tree (its operations) View Solution

16) Write a program to implement B Trees (its operations) View Solution

17) Write a program to implement B+ Trees (its operations) View Solution

18) Write a program to implement the graph traversal methods (Breadth First Search) View Solution

19) Write a program to implement the graph traversal methods (Depth First Search) View Solution

20) Write a program to Implement a Pattern matching algorithms using Boyer- Moore View Solution

21) Write a program to Implement a Pattern matching algorithms using Knuth-Morris-Pratt View Solution