lab04.cpp
Problem Statement
lab04.cpp
Write a program in C++ to implement Array Representation of Linear Queue using class, constructor, member variables, member functions, and destructor.
Source Code
cpp
#include<iostream>
using namespace std;
template <class T>
class queue {
private:
T *arr;
int front = -1, rear = -1;
int n;
public:
queue(int size) {
n = size;
arr = new T[n];
cout << "Array created successfully with capacity: " << n;
}
bool isEmpty() {
if(front == -1 || front > rear) {
return true;
}
return false;
}
bool isFull() {
if(rear == n - 1) {
return true;
}
return false;
}
void enqueue(T elem) {
if(isFull()) {
cout << "Queue Overflow.";
}
else {
if(front == -1) {
front = 0;
}
arr[++rear] = elem;
cout << elem << " inserted to queue.";
}
}
void dequeue() {
if(isEmpty()) {
cout << "Queue is empty.";
}
else {
cout << arr[front++] << " removed from the queue";
}
}
void display() {
if(isEmpty()) {
cout << "Queue is empty.";
}
else {
cout << "\nCurrent queue: ";
for(int i = front; i <= rear; i++) {
cout << arr[i] << " ";
}
}
}
~queue() {
delete[] arr;
cout << "\nMemory cleared.";
}
};
int main() {
int size, elem, choice;
cout << "Enter the size: ";
cin >> size;
queue<int> obj(size);
while(true) {
cout << "\n1. Enqueue, 2. Dequeue, 3. Display, 4. Exit";
cout << "\nEnter your choice: ";
cin >> choice;
switch(choice) {
case 1:
cout << "Enter the element: ";
cin >> elem;
obj.enqueue(elem);
break;
case 2:
obj.dequeue();
break;
case 3:
obj.display();
break;
case 4:
return 0;
default:
cout << "\nWrong Choice.";
}
}
}1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101