Question

Array-based Queue Lecture 6 Two Class Exercises | Class Exercise #1 - Create an array-based queue that holds values of double data type. 1.) Create a program that produces the following output OUTPUT: Q Quit Enter your choice: e Enter an item: 1.1 E Enqueue D Dequeue s-show queue ← showMenuO function called in main) OQuit // screen clears-.. continue enqueuing.screen clearing with each iteration Enter your choice: e Queue is full. E Enqueue D Dequeue s Show queue 0 - Quit ← showMenuolunction called in main) Enter your choice: d //-screen clears- // continue dequeuing screen clearing with each iteration Enter your choice: d Queue is empty E Enqueue D Dequeue s Show queue Q - Quit ← showMenuo function called in main() Enter your choice: Enter your choice: s 1.1 -2.23.3 -> 4.4 -5.5 NULL E Enqueue D Dequeue s - Show queueshowMenu0 function called in main0 Q Quit Enter your choice: d Queue is empty. */ Press any key to continue.*/ 2.) Create a new C++ project and name it: Queue queue Create these three files in the project: : int : int -front o Queue.h Holds the class specification and-rear the class function definitions -items [SIZE]: double o main.cpp +Queue () +-Queue() | +ǐsFul10 +isEmpty)bool 3) In the Queue.h file, write a specification for a Queue class, based on this UML diagram. : bool 4.) Include the full function definitions in the Queue.h file. tenqueue (double item) void +dequeue (double &item): void +showQueue) : void 5.) In main.cpp file, declare a Queue object Name it: queue (size 5) 6.) Include a showMenu0 function in main to display a menu of choices. (see output above) The function is not part of the Queue class. 7.) The program should demonstrate the class functions, similar to the output Add and remove items from the queue to demonstrate enqueue&dequeue functions. Enter enough values to make the queue full, and in turn, remove all items to demonstrate an empty queue. 8.) Display all queue items

Answer 1

//queue.h

#include<iostream>
using namespace std;

class Queue{
   private:
       double *arr;
       int front,rear,capacity;
      
   public:
       Queue(int size){
           capacity=size;
           front=-1;
           rear =-1;
           arr = new double[capacity];
          
       }
       ~Queue(){
           front=-1;
           rear=-1;
           capacity=0;
           delete(arr);
       }
       bool isEmpty(){
           return front==-1;
       }
       bool isFull(){
           return (rear+1)%capacity==front;
       }
       void makeEmpty(){
           front=-1;
           rear=-1;
       }
      
       void enqueue(double data){
           rear++;
       rear%=capacity;
       arr[rear]=data;
       if(front==-1)front=rear;
       }
      
  
       void dequeue(double &item){
           item = arr[front];
       if(front==rear)
           front=rear=-1;
       else{
       front++;
       front%=capacity;}
       }
      
       void showQueue(){
           int i = front;
          
           while(i!=rear){
               cout<<arr[i]<<" ";
               i++;
               i%=capacity;
           }
           cout<<arr[rear]<<" ";
           cout<<"\n\n";
       }
};
//main.cpp

#include "queue.h"

void showMenu(){
   cout<<"\nE- Enqueue\nD- Dequeue\nS- Show Queue\nQ- Quit\n";
}
int main(){
   Queue queue(5);
   char choice;
   double data;
  
   do{
       showMenu();
       cout<<"Enter your choice : ";
       cin>>choice;
      
       switch(choice){
           case'e':
           case'E':{
               if(queue.isFull()){
                   cout<<"Queue is full\n";
                  
               }
               else{
               cout<<"Enter an item : ";
               cin>>data;
               queue.enqueue(data);
               }
          
               break;
           }  
          
           case'd':
           case'D':{
               if(queue.isEmpty()){
                   cout<<"Queue is empty\n\n";
               }
               else{
                   queue.dequeue(data);
                   cout<<"item : "<<data<<"\n\n";
               }
                 
               break;
           }
           case's':
           case'S':{
               queue.showQueue();
               cout<<"\n";
               break;
           }
           case'q':
           case'Q':{
              
               cout<<"Thank you!\n";
               break;
           }
           default:{
               cout<<"Invalid choice\n\n";
               break;
           }
          
              
       }
      
   }while(choice!='q'||choice!='Q');
   return 0;
}

//sample output

CAUsers\IshuManish\ Documents| mainquuu.exe Enqueue -Dequeue - Show Queue - Quit nter your choicee nter an item 1.1 Enqueue - Dequeue - Show Queue - Quit nter your choiceE nter an item 2.2 Enqueue -Dequeue - Show Queue - Quit nter your choicee nter an item 3.3 Enqueue - Dequeue - Show Queue - Quit nter your choicee nter an item 4.4 Enqueue -Dequeue - Show Queue - Quit nter your choice s 1 2.2 3.3 4.4 Enqueue - Dequeue - Show Queue - Quit nter your choiced item 1.1 Enqueue - Dequeue - Show Queue - Quit nter your choice s 2 3.3 4.4