P3 Dsa
P3 Dsa
Div. :A
Batch : A2
DSA PRACTICAL-3
Implement a simple queue using array perform the following operation on it :
1)Insertion(Enqueue)
2)Deletion(Dequeue)
3)Display
Code:
#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;
return 0;
}
Output :
Implement a circular queue using array perform the following operation
on it :
1)Insertion(Enqueue)
2)Deletion(Dequeue)
3)Display
Code:
#include <iostream>
int cirqueue[10];
return;
if (front == -1) {
front = 0;
rear = 0;
} else {
if (rear == size1 - 1)
rear = 0;
else
rear++;
cirqueue[rear] = value;
}
void dequeue() {
if (front == -1) {
return;
cout << "Element deleted from queue is: " << cirqueue[front] << endl;
if (front == rear) {
front = -1;
rear = -1;
} else {
if (front == size1 - 1)
front = 0;
else
front++;
void display() {
if (front == -1) {
return;
f1++;
}
} else {
f1++;
f1 = 0;
f1++;
int main() {
int x, value;
do {
cin >> x;
switch (x) {
case 1:
enqueue(value);
break;
case 2:
dequeue();
cout<<"-------------------------------------------------------------------"<<endl;
break;
case 3:
display();
cout<<"-------------------------------------------------------------------"<<endl;
break;
case 4:
break;
default:
} while (x != 4);
return 0;
}
OUTPUT :