Scribd
Upload
36 views

Array Implementation of Queue ADT

This C++ program implements a queue data structure using an array. The queue class contains methods to insert, delete, and display elements in the queue. The main function contains a menu loop that allows the user to test the queue functions by inserting, deleting, and displaying elements. When run, it demonstrates inserting three elements into the queue, displaying them, deleting one element, and displaying the updated queue.

Uploaded by

Shylaja Sajeev
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
36 views

Array Implementation of Queue ADT

This C++ program implements a queue data structure using an array. The queue class contains methods to insert, delete, and display elements in the queue. The main function contains a menu loop that allows the user to test the queue functions by inserting, deleting, and displaying elements. When run, it demonstrates inserting three elements into the queue, displaying them, deleting one element, and displaying the updated queue.

Uploaded by

Shylaja Sajeev
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

#include<iostream> #include<conio.h> #include<stdlib.

h> using namespace std; class queue { int queue1[5]; int rear,front; public: queue() { rear=-1; front=-1; } void insert(int x) { if(rear > 4) { cout <<"queue over flow"; front=rear=-1; return; } queue1[++rear]=x; cout <<"inserted" <<x; } void delet() { if(front==rear) { cout <<"queue under flow"; return; } cout <<"deleted" <<queue1[++front]; } void display() { if(rear==front) { cout <<" queue empty"; return; } for(int i=front+1;i<=rear;i++) cout <<queue1[i]<<" "; } };

main() { int ch; queue qu; while(1) { cout <<"\n1.insert 2.delet 3.display 4.exit\nEnter ur choice"; cin >> ch; switch(ch) { case 1: cout <<"enter the element"; cin >> ch; qu.insert(ch); break; case 2: qu.delet(); break; case 3: qu.display();break; case 4: exit(0); } } return (0); }

OUTPUT 1.insert 2.delet 3.display 4.exit Enter ur choice1 enter the element21 inserted21 1.insert 2.delet 3.display 4.exit Enter ur choice1 enter the element22 inserted22 1.insert 2.delet 3.display 4.exit Enter ur choice1 enter the element16 inserted16 1.insert 2.delet 3.display 4.exit Enter ur choice3 21 22 16 1.insert 2.delet 3.display 4.exit Enter ur choice2 deleted21

1.insert 2.delet 3.display 4.exit Enter ur choice3 22 16 1.insert 2.delet 3.display 4.exit Enter ur choice

You might also like