Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
18 views

C++ Program To Implement Queue Using Array

Program

Uploaded by

sports.study5
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

C++ Program To Implement Queue Using Array

Program

Uploaded by

sports.study5
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

C++ Program to Implement Queue using

Array
#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)

cout<<"Queue is empty"<<endl;

else {

cout<<"Queue elements are : ";

for (int i = front; i <= rear; i++)

cout<<queue[i]<<" ";

cout<<endl;

int main() {

int ch;

cout<<"1) Insert element to queue"<<endl;

cout<<"2) Delete element from queue"<<endl;

cout<<"3) Display all the elements of queue"<<endl;

cout<<"4) Exit"<<endl;

do {

cout<<"Enter your choice : "<<endl;

cin>>ch;

switch (ch) {

case 1: Insert();

break;

case 2: Delete();

break;

case 3: Display();

break;

case 4: cout<<"Exit"<<endl;

break;
default: cout<<"Invalid choice"<<endl;

} while(ch!=4);

return 0;

In the above program, the function Insert() inserts an element into the queue. If the rear is equal to
n-1, then the queue is full and overflow is displayed. If front is -1, it is incremented by 1. Then rear is
incremented by 1 and the element is inserted in index of rear. This is shown below −

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;

In the function Delete(), if there are no elements in the queue then it is


underflow condition. Otherwise the element at front is displayed and front is
incremented by one. This is shown below −

void Delete() {

if (front == - 1 || front > rear) {

cout<<"Queue Underflow ";


return ;

else {

cout<<"Element deleted from queue is : "<< queue[front] <<endl;

front++;;

In the function Display(), if front is -1 then queue is empty. Otherwise all the
queue elements are displayed using a for loop. This is shown below −

You might also like