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

Level-0 Diagram for this: A customer sends in an order form containing details of their order and their membership number. A check is made to verify that they are a member. When their order is verified, a check is made to validate that the items ordered are produced by the company. Next, the valid order is used to update the daily order file, and then used to create a shipping list and invoice, which are sent on to the Order Fulfilment System.

In this assignment, you will use all of the graphics commands you have learned to create an animated scene. Your program should have a clear theme and tell a story. You may pick any school-appropriate theme that you like. The program must include a minimum of: 5 circles 5 polygons 5 line commands 2 for loops 1 global variable You may wish to use the standard code for simplegui graphics below: import simplegui def draw_handler(canvas): frame = simplegui.create_frame('Testing', 600, 600) frame.set_canvas_background("Black") frame.set_draw_handler(draw_handler) frame.start() Submit Your Code After you write your code here in the programming environment, you will check it and submit it as usual. However, the grader will only perform basic checks against some requirements. If your code passes, you should submit your work, and your teacher will manually grade your submitted work using a rubric.

1. What is the difference between a relative cell reference and an absolute cell reference and give an example of when you would use each.