Scribd
Upload
71 views5 pages

Lab Practical-7: AIM:-Algorithm

The document describes implementing a queue using an array in C++. It includes the algorithms for insertion and deletion from the queue, provides sample source code for a Queue class with insertion, deletion and display methods, and includes a main method that demonstrates using the queue. The queue is implemented with a fixed size array, front and rear pointers, and methods to insert elements at the rear, delete elements from the front, and display the current elements in the queue.

Uploaded by

murli manohar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
71 views5 pages

Lab Practical-7: AIM:-Algorithm

The document describes implementing a queue using an array in C++. It includes the algorithms for insertion and deletion from the queue, provides sample source code for a Queue class with insertion, deletion and display methods, and includes a main method that demonstrates using the queue. The queue is implemented with a fixed size array, front and rear pointers, and methods to insert elements at the rear, delete elements from the front, and display the current elements in the queue.

Uploaded by

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

Lab Practical-7

AIM:- WAP to implement Queue using Array

ALGORITHM:-

Insertion
1) IF REAR = MAX -1 then
Print “OVERFLOW”;
2) ELSE
IF(FRONT == -1)
FRONT = 0;
REAR++;
ARR[REAR] = X;
3) End of IF
4) Exit

Deletion
1) IF FRONT = REAR then
Print “UNDERFLOW”;
2) ELSE
ITEM: =ARR (FRONT);
FRONT:=FRONT + 1;
3) End of IF
4) Exit

SOURCE CODE:-

#include<iostream>
using namespace std;
class Queue{
int arr[5],front, rear;
public:
Queue(){
front = -1;
rear = -1;
}
void insertion(int x){
if(rear>4)
cout<<"Overflow";
else{
if(front == -1)
front =0;
rear++;
arr[rear] = x;
}
}
void deletion(){
int item;
if(front == rear)
cout<<"Underflow";
else{
item =arr[front];
front = front+1;
cout<<"Deleted: "<<item;
}
}
void display(){
cout<<"Queue:- "<<endl;
for(int i=front;i<=rear;i++){
cout<<" "<<arr[i];
}
cout<<endl;
}
}obj;
int main(){
int item,choice,num;
cout<<"Kanhaiya Jee| 18bcs2463”;
cout<<"\nMENU:- "<<endl;
cout<<" 1.Insertion"<<endl;
cout<<" 2.Deletion"<<endl;
cout<<" 3.Display"<<endl;
cout<<" 4.Exit"<<endl;
do{
cout<<"\nEnter Choice: ";
cin>>choice;
switch(choice){
case 1 :
cout<<" Enter No of Element: ";
cin>>num;
for(int i=0; i<num; i++){
cout<<" Element"<<i<<": ";
cin>>item;
obj.insertion(item);
}
break;
case 2:
obj.deletion();
break;
case 3:
obj.display();
break;
case 4:
cout<<"Exititng..."<<endl;
default:
cout<<"Invalid Choice!!!"<<endl;
}
}while(choice!=4);
return 0;
}

OUTPUT:-

You might also like