Question

in c++ language, using quincy compiler

Write a program that will read in 12 characters from the keyboard between a – z in lowercase. These letters will be inserted into a queue (imported from the Queue.h header file). When the 12^th character has been entered, the queue will serve the characters one at a time to a character variable, which will push the values, one at a time, into a stack (using code imported from the Stack.h header file) and then popped off to the screen (using a standard output statement), thus reversing the order.

Bonus: 10% if the letters can be read into a vector that sorts the letters into reverse alphabetical order, printing them after the reversed list.

• A .cpp file called Reverser.cpp that accomplishes the tasks outlined in the specifications above
• The header files Queue.h and Stack.h

Answer 1

You did not provide code for Stack and Queue classes, so here I’m writing this code based on pure assumptions on those two classes. Here is the completed code for this problem. Comments are included, go through it, learn how things work and let me know if you have any doubts or if you need anything to change. If you are satisfied with the solution, please rate the answer. Thanks

Note: Please read the comments and do the necessary actions if needed, if still having troubles, provide your Stack and Queue files and I will update it as needed.

#include <iostream>

#include "Queue.h"

#include "Stack.h"

using namespace std;

int main() {

                //count of characters to read

                int count=12;

                char c;

                //asking for 12 characters

                cout<<"Enter "<<count<<" characters: ";

                //creating a Queue of characters

                Queue<char> que;

                //reading 12 values and enqueuing to the queue.

                //assuming your Queue class has a method called enqueue(), if it

                //is something else, replace 'enqueue' with your method name

                for(int i=0;i<count;i++){

                                cin>>c;

                                que.enqueue(c);

                }

                //now creating a Stack of characters

                Stack<char> stk;

                //looping and dequeing each character from queue, pushing to stack

                for(int i=0;i<count;i++){

                                //assuming queue has a method named dequeue(), if not, replace with

                                //your file name, if dequeue is not a value returning function, and you

                                //have a front() method, then assign que.front() value to c, and then

                                //call dequeue()

                                c=que.dequeue();

                                //pushing to stack

                                stk.push(c);

                }

                cout<<"Reversed: ";

                //now popping and displaying the characters from stack until it is empty

                while(!stk.is_empty()){

                                //if your pop method is not value returning and you have a top() method

                                //instead, then print the value of stk.top() to screen and then call stk.pop()

                                cout<<stk.pop()<<" ";

                }

                cout<<endl;

               

                return 0;

}