#include usingnamespace 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"<

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
 
#include <iostream>
usingnamespace 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();

    return0;
}
 
We continue to develop our Queue management system that we made in the
previous module.
You are asked to add a new functionality: adding two queues together. The result
should be a new queue, where the elements of the first queue come first, followed
by the second queue's elements.
Given the Queue class, overload the operator, so that the code in main works and
successfully adds two queues.
Transcribed Image Text:We continue to develop our Queue management system that we made in the previous module. You are asked to add a new functionality: adding two queues together. The result should be a new queue, where the elements of the first queue come first, followed by the second queue's elements. Given the Queue class, overload the operator, so that the code in main works and successfully adds two queues.
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY