Static 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. Queue.h: Include required header files. Create template class Declare a class named “Queue”. Inside the class, Inside the “private” access specifier, Create an object for the template Declare required variables. 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. Allocate memory dynamically for the template. Assign the values. Declare template class. Give definition for the destructor. Delete queue array and make it as null. Declare template class. Give function definition for “enqueue ()”. Check whether the queue is full using “isFull ()” function. If the condition is true then, print “The queue is full”. If the condition is not true then, Calculate the “rear” position. Assign “num” to the “queue_Array [rear]”. Increment the variable “numItems”. Declare template class. Give function definition for “dequeue ()”. 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, Calculate “front” position. Assign the value of “queue_Array [front]” to the variable “num”. 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 “isFull ()”. Assign “true” to a Boolean variable Check if “numItems” is less than “size” If the condition is true then assign “false” to the variable. Return the Boolean variable. Declare template class. Give function definition for “clear ()”. Decrement queue size and assign it to “front”. Decrement queue size and assign it to “rear”. Assign 0 to the variable “numItems”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 18, Problem 3PC

Program Plan Intro

Static 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.

Queue.h:

Include required header files.

Create template class

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

Inside the “private” access specifier,

Create an object for the template

Declare required variables.

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.

Allocate memory dynamically for the template.

Assign the values.

Declare template class.

Give definition for the destructor.

Delete queue array and make it as null.

Declare template class.

Give function definition for “enqueue ()”.

Check whether the queue is full using “isFull ()” function.

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

If the condition is not true then,

Calculate the “rear” position.

Assign “num” to the “queue_Array [rear]”.

Increment the variable “numItems”.

Declare template class.

Give function definition for “dequeue ()”.

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,

Calculate “front” position.

Assign the value of “queue_Array [front]” to the variable “num”.

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 “isFull ()”.

Assign “true” to a Boolean variable

Check if “numItems” is less than “size”

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

Return the Boolean variable.

Declare template class.

Give function definition for “clear ()”.

Decrement queue size and assign it to “front”.

Decrement queue size and assign it to “rear”.

Assign 0 to the variable “numItems”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

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 {…

Computer science JAVA programming language

c++ Write a client function that returns the back of a queue while leaving the queue unchanged. This function can call any of the methods of the ADT queue. It can also create new queues. The return type is ITemType, and it accepts a queue as a parameter.