How do you solve this code?

Question

#include <iostream>
using namespace std;

class Queue {
int size;
int* queue;
}
public:
Queue() {
size = 0;
queue = new int[100];
}
void add(int data) {
queue[size] = data;
size++;

void remove() {
if (size == 0) {
cout << "Queue is empty"<<endl;
return;
}
else {
for (int i = 0; i < size - 1; i++) {
queue[i] = queue[i + 1];
}
size--;
}
}
void print() {
if (size == 0) {
cout << "Queue is empty"<<endl;
return;
}
for (int i = 0; i < size; i++) {
cout<<queue[i]<<" <- ";
}
cout << endl;
}
//your code goes here
};

int main() {
Queue q1;
q1.add(42); q1.add(2); q1.add(8); q1.add(1);
Queue q2;
q2.add(3); q2.add(66); q2.add(128); q2.add(5);
Queue q3 = q1+q2;
q3.print();

return 0;
}

Answer 1

Rakesh Deep

Please don't give readymade code, otherwise opponent will not try by yourself.

Answer 2

do it from yourself,, this question is in the c++ intermediate course , and solve it yourself cuz a real coder is not who ask questions , the real question is who finds the solution

Answer 3

Sina Ghorbanian Don't provide readymade code give the member hint let them try to learn themself.

Answer 4

Okay, thank you

Answer 5

Queue management test module 2 c++ intermediate

Answer 6

#include <iostream>
using namespace std;

class Queue {
private:
int size;
int* queue;

public:
Queue() {
size = 0;
queue = new int[100];
}

void add(int data) {
queue[size] = data;
size++;
}

void remove() {
if (size == 0) {
cout << "Queue is empty" << endl;
return;
}
else {
for (int i = 0; i < size - 1; i++) {
queue[i] = queue[i + 1];
}
size--;
}
}

void print() {
if (size == 0) {
cout << "Queue is empty" << endl;
return;
}
for (int i = 0; i < size; i++) {
cout << queue[i] << " <- ";
}
cout << endl;
}

// Operator overloading for adding two queues
Queue operator+(const Queue& other) {
Queue result;
for (int i = 0; i < this->size; i++) {
result.add(this->queue[i]);
}
for (int i = 0; i < other.size; i++) {
result.add(other.queue[i]);
}
return result;
}
};

int main() {
Queue q1;
q1.add(42); q1.add(2); q1.add(8); q1.add(1);
Queue q2;
q2.add(3); q2.add(66); q2.add(128); q2.add(5);
Queue q3 = q1 + q2;
q3.print();

return 0;
}

Answer 7

ul {list-style:none;
color:56494c;}
li::before {content: "•";
color:brown;}
p {color:56494c;
font-family:georgia;
background-color:;}
form {color:56494c;}

Answer 8

Try writing it in Html