Â
The Code given below can be used in TURBO C++ Compilers: -
#include <iostream.h>
#include<conio.h>
#include <stdlib.h>
#define max 5
int queue[max], front=-1, rear=-1;
void insert_element(int queue[], int x);
int remove_element(int queue[]);
void display(int queue[]);
void main()
{
clrscr();
int choice, val;
cout<<"MENU:\n1. Insert Element\n2. Remove Element\n3. Display\n4. Exit\n";
do
{
cout<<"\nEnter choice: ";
cin>>choice;
switch(choice)
{
case 1: cout<<"Enter a value: ";
cin>>val;
insert_element(queue,val);
break;
case 2: cout<<remove_element(queue);
break;
case 3: display(queue);
break;
case 4: exit(1);
break;
default: cout<<"Invalid Choice!"<<endl;
}
}while (choice!=4);
getch();
}
void insert_element(int queue[], int x)
{
if (rear==max-1)
cout<<"Overflow"<<endl;
else if(front==-1 && rear==-1)
{
front=rear=0;
queue[rear]=x;
}
else
{
rear=rear+1;
queue[rear]=x;
}
}
int remove_element(int queue[])
{
int y;
if (front==-1 || front>rear)
{
cout<<"Underflow"<<endl;
return -1;
}
else
{
y=queue[front];
front=front+1;
return y;
}
}
void display(int queue[])
{
int i;
cout<<"Values are: ";
for(i=front; i<=rear; i++)
cout<<queue[i]<<" ";
}
The Code given below can be used in gcc/g++ Compilers: -
#include <iostream>
#define max 5
using namespace std;
int queue[max], front = -1, rear = -1;
void insert_element(int queue[], int x);
int remove_element(int queue[]);
void display(int queue[]);
int main()
{
int choice, val;
cout << "MENU:\n1. Insert Element\n2. Remove Element\n3. Display\n4. Exit\n";
do
{
cout << "\nEnter choice: ";
cin >> choice;
switch (choice)
{
case 1:
{
cout << "Enter a value: ";
cin >> val;
insert_element(queue, val);
break;
}
case 2:
{
cout << remove_element(queue);
break;
}
case 3:
{
display(queue);
break;
}
case 4:
{
exit(0);
break;
}
default:
{
cout << "Invalid Choice!" << endl;
}
}
} while (choice != 4);
return 0;
}
void insert_element(int queue[], int x)
{
if (rear == max - 1)
{
cout << "Overflow" << endl;
}
else if (front == -1 && rear == -1)
{
front = rear = 0;
queue[rear] = x;
}
else
{
rear = rear + 1;
queue[rear] = x;
}
}
int remove_element(int queue[])
{
int y;
if (front == -1 || front > rear)
{
cout << "Underflow" << endl;
return -1;
}
else
{
y = queue[front];
front = front + 1;
return y;
}
}
void display(int queue[])
{
int i;
cout << "Values are: ";
for (i = front; i <= rear; i++)
{
cout << queue[i] << " ";
}
}
#ENJOY CODING
Post a Comment
FOR ANY DOUBTS AND ERRORS FEEL FREE TO ASK. YOUR DOUBTS WILL BE ADDRESSED ASAP