Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Explain the flow of the code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow. #include "deque.h" #include "linkedlist.h" #include using namespace std; class DLLDeque : public Deque { DoublyLinkedList* list; public: DLLDeque() { list = new DoublyLinkedList(); } void addFirst(int e) { list->addAt(e,1); } void addLast(int e) { list->addAt(e,size()+1); } int removeFirst() { return list->removeAt(1); } int removeLast() { return list->removeAt(size()); } int size(){ return list->size(); } bool isEmpty() { return list->isEmpty(); } // OPTIONAL: a helper method to help you debug void print() { if (isEmpty()) { cout << "(empty)"; return; } list->print(); } // WARNING! Do not modify this method! // Doing so will nullify your score for this activity. void final_print() { if (isEmpty()) { cout << "(empty)"; return; } while(!isEmpty()) { cout << removeFirst(); if (size() > 0) { cout << ", "; } } } };

Explain the flow of the code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow. #include "deque.h" #include "linkedlist.h" #include using namespace std; class DLLDeque : public Deque { DoublyLinkedList* list; public: DLLDeque() { list = new DoublyLinkedList(); } void addFirst(int e) { list->addAt(e,1); } void addLast(int e) { list->addAt(e,size()+1); } int removeFirst() { return list->removeAt(1); } int removeLast() { return list->removeAt(size()); } int size(){ return list->size(); } bool isEmpty() { return list->isEmpty(); } // OPTIONAL: a helper method to help you debug void print() { if (isEmpty()) { cout << "(empty)"; return; } list->print(); } // WARNING! Do not modify this method! // Doing so will nullify your score for this activity. void final_print() { if (isEmpty()) { cout << "(empty)"; return; } while(!isEmpty()) { cout << removeFirst(); if (size() > 0) { cout << ", "; } } } };

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question

C++ Programming
Activity: Deque Linked List


Explain the flow of the code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow.

#include "deque.h"
#include "linkedlist.h"
#include <iostream>
using namespace std;

class DLLDeque : public Deque {
   DoublyLinkedList* list;  
    public:
    DLLDeque() {
        list = new DoublyLinkedList(); 
    }

        void addFirst(int e) {
            list->addAt(e,1); 
        }
    
        void addLast(int e) {
            list->addAt(e,size()+1); 
        }

        int removeFirst() {
            return list->removeAt(1); 
        }

        int removeLast() {
            return list->removeAt(size()); 
        }

        int size(){
            return list->size();
        }
    
        bool isEmpty() {
            return list->isEmpty();
        }    

        // OPTIONAL: a helper method to help you debug
        void print() {
            if (isEmpty()) {
                cout << "(empty)";
                return;
            }
            list->print();
        }

    
        // WARNING! Do not modify this method!
        // Doing so will nullify your score for this activity.
        void final_print() {
            if (isEmpty()) {
                cout << "(empty)";
                return;
            }
            while(!isEmpty()) {
                cout << removeFirst();
                if (size() > 0) {
                cout << ", ";
            }
        }
    }
};
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS