Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Part 2: In this part, you are going to design a dynamic queue of characters implemented as a linked list. Complete the code below as specified by the comments in bold. typedef char el t; class Queue { private: struct QueueNode el t letter; { QueueNode *next; // letter in the node // Pointer to the next node } ; // declare the following: // Pointer to the front of the Queue // Pointer to the rear of the Queue // Number of items in Queue public: Queue () ; // Constructor ~Queue () ; // Destructor // Queue operations void enqueue (el_t); void dequeue (el_t &); void displayAll () const; bool isEmpty() const; // implement the public methods highlighted in bold here int main () { Queue q; el t c; cout << " initial Queue contents" << endl; q. displayAll(); q. dequeue (c); q.enqueue ( 'a'); cout << endl << " Queue contents after adding a: << endl; q. displayAll(); q. enqueue ( 'b' ) ; q.enqueue ( 'c'); q. enqueue ( 'd’); q.enqueue ( 'e' ) ; q.enqueue ( 'f'); cout << endl << " Queue contents after adding b-f: << endl; q.displayAl1(); q. dequeue (c); cout << endl << c << endl; cout << endl << " Queue contents after removing one element: " << endl; q.displayAl1(); q. dequeue (c); cout << endl << Removed element: << c << endl; cout << endl << " Queue contents after removing another element: << endl; q. displayAl1(); q. enqueue ( 'g' ) ; q.enqueue ( 'h’ ); q.enqueue ( 'i'); cout << endl << " Queue contents after adding g, h, i: " << endl; q.displayAl1(); q. dequeue (c); q. dequeue (c); q.dequeue (c); q.dequeue (c); cout << endl << " Queue contents after removing 4 elements: << endl; q. dequeue (c); q. dequeue (c); cout << endl << " final Queue contents << endl; q.displayAl1(); return 0; }

Part 2: In this part, you are going to design a dynamic queue of characters implemented as a linked list. Complete the code below as specified by the comments in bold. typedef char el t; class Queue { private: struct QueueNode el t letter; { QueueNode *next; // letter in the node // Pointer to the next node } ; // declare the following: // Pointer to the front of the Queue // Pointer to the rear of the Queue // Number of items in Queue public: Queue () ; // Constructor ~Queue () ; // Destructor // Queue operations void enqueue (el_t); void dequeue (el_t &); void displayAll () const; bool isEmpty() const; // implement the public methods highlighted in bold here int main () { Queue q; el t c; cout << " initial Queue contents" << endl; q. displayAll(); q. dequeue (c); q.enqueue ( 'a'); cout << endl << " Queue contents after adding a: << endl; q. displayAll(); q. enqueue ( 'b' ) ; q.enqueue ( 'c'); q. enqueue ( 'd’); q.enqueue ( 'e' ) ; q.enqueue ( 'f'); cout << endl << " Queue contents after adding b-f: << endl; q.displayAl1(); q. dequeue (c); cout << endl << c << endl; cout << endl << " Queue contents after removing one element: " << endl; q.displayAl1(); q. dequeue (c); cout << endl << Removed element: << c << endl; cout << endl << " Queue contents after removing another element: << endl; q. displayAl1(); q. enqueue ( 'g' ) ; q.enqueue ( 'h’ ); q.enqueue ( 'i'); cout << endl << " Queue contents after adding g, h, i: " << endl; q.displayAl1(); q. dequeue (c); q. dequeue (c); q.dequeue (c); q.dequeue (c); cout << endl << " Queue contents after removing 4 elements: << endl; q. dequeue (c); q. dequeue (c); cout << endl << " final Queue contents << endl; q.displayAl1(); return 0; }

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

in c++ languge please 

Part 2: In this part, you are going to design a dynamic queue of characters implemented as a linked list. Complete the code below as specified by the comments in bold. typedef char el t; class Queue { private: struct QueueNode el t letter; { QueueNode *next; // letter in the node // Pointer to the next node } ; // declare the following: // Pointer to the front of the Queue // Pointer to the rear of the Queue // Number of items in Queue public: Queue () ; // Constructor ~Queue () ; // Destructor // Queue operations void enqueue (el_t); void dequeue (el_t &); void displayAll () const; bool isEmpty() const; // implement the public methods highlighted in bold here
Transcribed Image Text:Part 2: In this part, you are going to design a dynamic queue of characters implemented as a linked list. Complete the code below as specified by the comments in bold. typedef char el t; class Queue { private: struct QueueNode el t letter; { QueueNode *next; // letter in the node // Pointer to the next node } ; // declare the following: // Pointer to the front of the Queue // Pointer to the rear of the Queue // Number of items in Queue public: Queue () ; // Constructor ~Queue () ; // Destructor // Queue operations void enqueue (el_t); void dequeue (el_t &); void displayAll () const; bool isEmpty() const; // implement the public methods highlighted in bold here
int main () { Queue q; el t c; cout << " initial Queue contents" << endl; q. displayAll(); q. dequeue (c); q.enqueue ( 'a'); cout << endl << " Queue contents after adding a: << endl; q. displayAll(); q. enqueue ( 'b' ) ; q.enqueue ( 'c'); q. enqueue ( 'd’); q.enqueue ( 'e' ) ; q.enqueue ( 'f'); cout << endl << " Queue contents after adding b-f: << endl; q.displayAl1(); q. dequeue (c); cout << endl << c << endl; cout << endl << " Queue contents after removing one element: " << endl; q.displayAl1(); q. dequeue (c); cout << endl << Removed element: << c << endl; cout << endl << " Queue contents after removing another element: << endl; q. displayAl1(); q. enqueue ( 'g' ) ; q.enqueue ( 'h’ ); q.enqueue ( 'i'); cout << endl << " Queue contents after adding g, h, i: " << endl; q.displayAl1(); q. dequeue (c); q. dequeue (c); q.dequeue (c); q.dequeue (c); cout << endl << " Queue contents after removing 4 elements: << endl; q. dequeue (c); q. dequeue (c); cout << endl << " final Queue contents << endl; q.displayAl1(); return 0; }
Transcribed Image Text:int main () { Queue q; el t c; cout << " initial Queue contents" << endl; q. displayAll(); q. dequeue (c); q.enqueue ( 'a'); cout << endl << " Queue contents after adding a: << endl; q. displayAll(); q. enqueue ( 'b' ) ; q.enqueue ( 'c'); q. enqueue ( 'd’); q.enqueue ( 'e' ) ; q.enqueue ( 'f'); cout << endl << " Queue contents after adding b-f: << endl; q.displayAl1(); q. dequeue (c); cout << endl << c << endl; cout << endl << " Queue contents after removing one element: " << endl; q.displayAl1(); q. dequeue (c); cout << endl << Removed element: << c << endl; cout << endl << " Queue contents after removing another element: << endl; q. displayAl1(); q. enqueue ( 'g' ) ; q.enqueue ( 'h’ ); q.enqueue ( 'i'); cout << endl << " Queue contents after adding g, h, i: " << endl; q.displayAl1(); q. dequeue (c); q. dequeue (c); q.dequeue (c); q.dequeue (c); cout << endl << " Queue contents after removing 4 elements: << endl; q. dequeue (c); q. dequeue (c); cout << endl << " final Queue contents << endl; q.displayAl1(); return 0; }
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
ADT and Class
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS