Scribd
Upload
56 views9 pages

Code:-: 5.to Perform Menu Driven Code For Queue Operation:-1. Insertion 2. Deletation 3. Display

The document describes a menu driven C program to implement a queue using an array. The menu allows the user to insert elements into the queue, delete elements from the queue, display the front element, display all elements, and quit the program. Functions are defined to handle insertion, deletion, checking if the queue is full or empty, and displaying the queue elements. The program is run with sample inputs and outputs demonstrating its queue implementation functionality.

Uploaded by

Shruti Ninawe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
56 views9 pages

Code:-: 5.to Perform Menu Driven Code For Queue Operation:-1. Insertion 2. Deletation 3. Display

The document describes a menu driven C program to implement a queue using an array. The menu allows the user to insert elements into the queue, delete elements from the queue, display the front element, display all elements, and quit the program. Functions are defined to handle insertion, deletion, checking if the queue is full or empty, and displaying the queue elements. The program is run with sample inputs and outputs demonstrating its queue implementation functionality.

Uploaded by

Shruti Ninawe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

5.

to perform menu driven code for queue operation :-


1. Insertion
2. Deletation
3. Display

Code:-
/* Menu Driven C Program to implement queue using array */

#include<stdio.h>

#include<stdlib.h>

#define MAX 10

int queue_arr[MAX];

int rear=-1;

int front=-1;

void insert(int item);

int del();

int peek();

void display();

int isFull();

int isEmpty();

int main()

int choice,item;

while(1)

printf("\n1.Insert\n");

printf("2.Delete\n");

printf("3.Display element at the front\n");

printf("4.Display all elements of the queue\n");


printf("5.Quit\n");

printf("\nEnter your choice : ");

scanf("%d",&choice);

switch(choice)

case 1:

printf("\nInput the element for adding in queue : ");

scanf("%d",&item);

insert(item);

break;

case 2:

item=del();

printf("\nDeleted element is %d\n",item);

break;

case 3:

printf("\nElement at the front is %d\n",peek());

break;

case 4:

display();

break;

case 5:

exit(1);

default:

printf("\nWrong choice\n");

} /*End of switch*/

} /*End of while*/

return 0;

}
void insert(int item)

if( isFull() )

printf("\nQueue Overflow\n");

return;

if( front == -1 )

front=0;

rear=rear+1;

queue_arr[rear]=item ;

} /*End of insert()*/

int del()

int item;

if( isEmpty() )

printf("\nQueue Underflow\n");

exit(1);

item=queue_arr[front];

front=front+1;

return item;

} /*End of del()*/

int peek()

if( isEmpty() )

{
printf("\nQueue Underflow\n");

exit(1);

return queue_arr[front];

} /*End of peek()*/

int isEmpty()

if( front==-1 || front==rear+1 )

return 1;

else

return 0;

} /*End of isEmpty()*/

int isFull()

if( rear==MAX-1 )

return 1;

else

return 0;

} /*End of isFull()*/

void display()

int i;

if ( isEmpty() )

printf("\nQueue is empty\n");

return;

printf("\nQueue is :\n\n");
for(i=front;i<=rear;i++)

printf("%d ",queue_arr[i]);

printf("\n\n");

} /*End of display() */

Output:-

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 1

Input the element for adding in queue : 1

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 1

Input the element for adding in queue : 2


1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 1

Input the element for adding in queue : 3

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 1

Input the element for adding in queue : 4

1.Insert

2.Delete

3.Display element at the front


4.Display all elements of the queue

5.Quit

Enter your choice : 4

Queue is :

1 2 3 4

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 3

Element at the front is 1

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue


5.Quit

Enter your choice : 2

Deleted element is 1

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 2

Deleted element is 2

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 2


Deleted element is 3

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 2

Deleted element is 4

1.Insert

2.Delete

3.Display element at the front

4.Display all elements of the queue

5.Quit

Enter your choice : 2

Queue Underflow

You might also like