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

solve this questions for me .

a) first player is the minimizing player. What move should be chosen?b) What nodes would not need to be examined using the alpha-beta pruning procedure?

Consider the problem of finding a path in the grid shown below from the position S to theposition G. The agent can move on the grid horizontally and vertically, one square at atime (each step has a cost of one). No step may be made into a forbidden crossed area. Inthe case of ties, break it using up, left, right, and down.(a) Draw the search tree in a greedy search. Manhattan distance should be used as theheuristic function. That is, h(n) for any node n is the Manhattan distance from nto G. The Manhattan distance between two points is the distance in the x-directionplus the distance in the y-direction. It corresponds to the distance traveled along citystreets arranged in a grid. For example, the Manhattan distance between G and S is4. What is the path that is found by the greedy search?(b) Draw the search tree in an A∗search. Manhattan distance should be used as the