Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Part 1: In this part, you are going to design a static queue of characters implemented as an array of 5 characters. Complete the code below as specified by the comments in bold. // define aliases for element type and queue size class Queue { private: // declare array to hold queue elements, // integers to hold front and rear positions, // and another integer to keep track of the number of items in Queue public: // Write the prototype of the Constructor, enqueue, dequeue, isFull, // isEmpty, displayAll } ; // 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. displayAll (); return 0;

Part 1: In this part, you are going to design a static queue of characters implemented as an array of 5 characters. Complete the code below as specified by the comments in bold. // define aliases for element type and queue size class Queue { private: // declare array to hold queue elements, // integers to hold front and rear positions, // and another integer to keep track of the number of items in Queue public: // Write the prototype of the Constructor, enqueue, dequeue, isFull, // isEmpty, displayAll } ; // 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. displayAll (); 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++ language please 

Part 1: In this part, you are going to design a static queue of characters implemented as an array of 5 characters. Complete the code below as specified by the comments in bold. // define aliases for element type and queue size class Queue { private: // declare array to hold queue elements, // integers to hold front and rear positions, // and another integer to keep track of the number of items in Queue public: // Write the prototype of the Constructor, enqueue, dequeue, isFull, // isEmpty, displayAll } ; // 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);
Transcribed Image Text:Part 1: In this part, you are going to design a static queue of characters implemented as an array of 5 characters. Complete the code below as specified by the comments in bold. // define aliases for element type and queue size class Queue { private: // declare array to hold queue elements, // integers to hold front and rear positions, // and another integer to keep track of the number of items in Queue public: // Write the prototype of the Constructor, enqueue, dequeue, isFull, // isEmpty, displayAll } ; // 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. displayAll (); return 0;
Transcribed Image Text: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. displayAll (); return 0;
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 11 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Fundamentals of Boolean Algebra and Digital Logics
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.
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