Dynamic Queue Template Program Plan: Main.cpp: Include required header files. Inside “main ()” function, Declare a constant variable Declare a template Manipulate and insert elements into the queue using “enqueue ()” function. Delete the queue elements using “dequeue ()” function. Dynqueue.h: Include required header files. Create template class Declare a class named “Dynqueue”. Inside the class, Inside the “private” access specifier, Create a structure named “QueueNode”. Create an object for the template Create a pointer named “next”. Create two pointers named “front” and “rear”. Declare a variable. Inside “public” access specifier, Declare constructor and destructor. Declare the functions “enqueue ()”, “dequeue ()”, “isEmpty ()”, “isFull ()”, and “clear ()”. Declare template class. Give definition for the constructor. Assign the values. Declare template class. Give definition for the destructor. Call the function “clear ()”. Declare template class. Give function definition for “enqueue ()”. Make the pointer “newNode” as null. Assign “num” to newNode->value. Make newNode->next as null. Check whether the queue is empty using “isEmpty ()” function. If the condition is true then, assign newNode to “front” and “rear”. If the condition is not true then, Assign newNode to rear->next Assign newNode to “rear”. Increment the variable “numItems”. Declare template class. Give function definition for “dequeue ()”. Assign temp pointer as null. Check if the queue is empty using “isEmpty ()” function. If the condition is true then print “The queue is empty”. If the condition is not true then, Assign the value of front to the variable “num”. Make front->next as “temp”. Delete the front value Make temp as front. Decrement the variable “numItems”. Declare template class. Give function definition for “isEmpty ()”. Assign “true” to a Boolean variable Check if “numItems” is true. If the condition is true then assign “false” to the variable. Return the Boolean variable. Declare template class. Give function definition for “clear ()”. Create an object for template. Dequeue values from queue till the queue becomes empty using “while” condition.

Question

Want to see the full answer?

Answer 1

Question

Chapter 19, Problem 4PC

Program Plan Intro

Dynamic Queue Template

Program Plan:

Main.cpp:

Include required header files.

Inside “main ()” function,

Declare a constant variable

Declare a template

Manipulate and insert elements into the queue using “enqueue ()” function.

Delete the queue elements using “dequeue ()” function.

Dynqueue.h:

Include required header files.

Create template class

Declare a class named “Dynqueue”. Inside the class,

Inside the “private” access specifier,

Create a structure named “QueueNode”.

Create an object for the template

Create a pointer named “next”.

Create two pointers named “front” and “rear”.

Declare a variable.

Inside “public” access specifier,

Declare constructor and destructor.

Declare the functions “enqueue ()”, “dequeue ()”, “isEmpty ()”, “isFull ()”, and “clear ()”.

Declare template class.

Give definition for the constructor.

Assign the values.

Declare template class.

Give definition for the destructor.

Call the function “clear ()”.

Declare template class.

Give function definition for “enqueue ()”.

Make the pointer “newNode” as null.

Assign “num” to newNode->value.

Make newNode->next as null.

Check whether the queue is empty using “isEmpty ()” function.

If the condition is true then, assign newNode to “front” and “rear”.

If the condition is not true then,

Assign newNode to rear->next

Assign newNode to “rear”.

Increment the variable “numItems”.

Declare template class.

Give function definition for “dequeue ()”.

Assign temp pointer as null.

Check if the queue is empty using “isEmpty ()” function.

If the condition is true then print “The queue is empty”.

If the condition is not true then,

Assign the value of front to the variable “num”.

Make front->next as “temp”.

Delete the front value

Make temp as front.

Decrement the variable “numItems”.

Declare template class.

Give function definition for “isEmpty ()”.

Assign “true” to a Boolean variable

Check if “numItems” is true.

If the condition is true then assign “false” to the variable.

Return the Boolean variable.

Declare template class.

Give function definition for “clear ()”.

Create an object for template.

Dequeue values from queue till the queue becomes empty using “while” condition.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Stacks and Queues are called data structures because their operations are specialized.

C++ ProgrammingActivity: Queue Linked List Explain the flow of the code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow. #include "queue.h" #include "linkedlist.h" class SLLQueue : public Queue { LinkedList* list; public: SLLQueue() { list = new LinkedList(); } void enqueue(int e) { list->addTail(e); return; } int dequeue() { int elem; elem = list->removeHead(); return elem; } int first() { int elem; elem = list->get(1); return elem;; } int size() { return list->size(); } bool isEmpty() { return list->isEmpty(); } int collect(int max) { int sum = 0; while(first() != 0) { if(sum + first() <= max) { sum += first(); dequeue(); } else {…

Write a C++ program to perform the Queue operation. Note:Use the following class template for Queue creation. template <class T>class Queue{ private: int front,rear; T *queue; int maxsize;}; Define the following function in the class Queue class Method name Description int isFull() The method is used to check whether the queue is full or not. void insert(T) The method is used to display the rear element in the queue (if the queue is stored with the element(s)). void deletion() The method is used to delete the front element from the queue. void atFront() The method is used to display the front element in the queue (if the queue is stored with the element(s)). void atRear() The method is used to add data to the rear end of the queue. void display() The method is used to display all the data in the queue. int isEmpty() The method is used to check whether the queue is empty or not. Input and Output Format:The first line of input…