Q#1
Write a C++ program to implement enqueue, dequeue, get front value and
count function using arrays.
#include <iostream>
using namespace std;
int queue[100], n = 100, front = – 1, rear = – 1;
void Insert() {
int val;
if (rear == n – 1)
cout<<“Queue Overflow”<<endl;
else {
if (front == – 1)
front = 0;
cout<<“Insert the element in queue : “<<endl;
cin>>val;
rear++;
queue[rear] = val;
}
}
void Delete() {
if (front == – 1 || front > rear) {
cout<<“Queue Underflow “;
return ;
} else {
cout<<“Element deleted from queue is : “<< queue[front] <<endl;
front++;;
}
}
void Display() {
if (front == – 1)
Sign up to view the full document!