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 18, 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

A double-ended queue or deque is a generalization of a stack and a queue that supports adding and removing items from either the front or the back of the data structure. This assignment has two parts: Part-1 Create a doubly linked list based DeQueDLL class that implements the DequeInterface. The class skeleton and interface are provided to you. Implement a String toString () method that creates and returns a string that correctly represents the current deque. Such a method could prove useful for testing and debugging the class and for testing and debugging applications that use the class. Assume each queued element already provides its own reasonable toString method. Part-2 Create an application program that gives a user the following three options to choose from – insert, delete, and quit. If the user selects ‘insert’, the program should accept the integer input from the user and insert it into the deque in a sorted manner. If the user selects ‘delete’, the program should…

True or False? ___________ The ADT makes use of static array for its queue implementation. ___________ ___________ The class includes a constructor and destructor. ___________ A value must be provided when you initiate a dequeue operation.

3. Define a function named stackToQueue. This function expects a stack as an argument. The function builds and returns an instance of LinkedQueue that contains the items in the stack. The function assumes that the stack has the interface described in Chapter 7, "Stacks." The function's postconditions are that the stack is left in the same state as it was before the function was called, and that the queue's front item is the one at the top of the stack. Use this Python template: class Queue:'''TODO: Remove the "pass" statements and implement each methodAdd any methods if necesssaryDON'T use any builtin queue class to store your items'''def __init__(self): # Constructor functionpassdef isEmpty(self): # Returns True if the queue is empty or False otherwisepassdef len(self): # Returns the number of items in the queuepassdef peek(self): # Returns the item at the front of the queuepassdef add(self, item): # Adds item to the rear of the queuepassdef pop(self): # Removes and returns the item…