Queue Exceptions Program Plan: “main.cpp”: This program features queues that can throw exceptions and print an appropriate error message and should terminate the program. Include the required header files. Prompt the user to enqueue 5 items. Use of try – catch exceptional handling that returns error message and terminates the program if the queue overflows. Prompt the user and allow user option to overflow the queue and dequeue the queue and print the values present in the queue. “IntQueue.h”: Include all the required header files. Declare all the variables present in the queue along with their data types. Declare all the function definition. Declare the class underflow and overflow to check for exceptional handling in queue. “IntQueue.cpp”: Include all the required header files. Call a constructor to create a queue and initialize its elements. Initialize front and rear each to -1 and the number of elements initially present to 0. A destructor is called to delete the queue array. Define a queue function enqueue that inserts the value in variable num at the rear of the queue. Define a queue function dequeue that deletes the value at the front of the queue, and copies it into variable. Define a queue function isEmpty returns true if the queue is empty, and false if elements are present in the queue. Define a Queue function is Full return true if queue is full and false if queue is not full.

Question

Want to see the full answer?

Answer 1

Question

Chapter 18, Problem 7PC

Program Plan Intro

Queue Exceptions

Program Plan:

“main.cpp”:

This program features queues that can throw exceptions and print an appropriate error message and should terminate the program.

Include the required header files.

Prompt the user to enqueue 5 items.

Use of try – catch exceptional handling that returns error message and terminates the program if the queue overflows.

Prompt the user and allow user option to overflow the queue and dequeue the queue and print the values present in the queue.

“IntQueue.h”:

Include all the required header files.

Declare all the variables present in the queue along with their data types.

Declare all the function definition.

Declare the class underflow and overflow to check for exceptional handling in queue.

“IntQueue.cpp”:

Include all the required header files.

Call a constructor to create a queue and initialize its elements.

Initialize front and rear each to -1 and the number of elements initially present to 0.

A destructor is called to delete the queue array.

Define a queue function enqueue that inserts the value in variable num at the rear of the queue.

Define a queue function dequeue that deletes the value at the front of the queue, and copies it into variable.

Define a queue function isEmpty returns true if the queue is empty, and false if elements are present in the queue.

Define a Queue function is Full return true if queue is full and false if queue is not full.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

C# Programing Language Given the code below 1.Change all of the low-level arrays in your program to use the appropriate C# collection class instead. Be sure to implement Deck as a Stack 2. Make sure that you use the correct type-safe generic designations throughout your program. 3.Write code that watches for that incorrect data and throws an appropriate exception if bad data is found.4. Write Properties instead of Getter and Setter methods. no lamdas, no delegates, no LINQ, no eventsGo Fish using System; namespace GoFish{public enum Suit { Clubs, Diamonds, Hearts, Spades };public enum Rank { Ace, Two, Three, Four, Five, Six, Seven, Eight, Nine, Ten, Jack, Queen, King }; // ----------------------------------------------------------------------------------------------------- public class Card{public Rank Rank { get; private set; }public Suit Suit { get; private set; } public Card(Suit suit, Rank rank){this.Suit = suit;this.Rank = rank;} public override string ToString(){return ("[" +…

stacks and queues. program must be able to handle all test cases without causing an exception Note that this problem does not require recursion to solve (though you can use that if you wish).

Queue Exceptions: Modify the static queue class provided in our lecture as follows. Make the isFull and isEmpty member functions private. Deﬁne a queue overﬂow exception and modify enqueue so that it throws this exception when the queue runs out of space. Deﬁne a queue underﬂow exception and modify dequeue so that it throws this exception when the queue is empty. Rewrite the main program so that it catches overﬂow exceptions when they occur. The exception handler for queue overﬂow should print an appropriate error message and then terminate the program.Here's the code so far:data.h: #pragma once class IntQueue{private:int *queueArray;int queueSize;int front;int rear;int numItems;public:IntQueue(int);~IntQueue();void enqueue(int);void dequeue(int &);bool isEmpty();bool isFull();void clear();};implementation: #include <iostream>#include "Data.h"using namespace std; //*************************// Constructor *//*************************IntQueue::IntQueue(int s){queueArray = new…