Error Testing Dynamic Stack: Program Plan: Main.cpp: Include required header files. Inside the “main ()” function, Create an object named “dstack” for stack. Declare a variable named “popElem”. Push 3 elements inside the stack using the function “push ()”. Pop 3 elements from the stack using the function “pop ()”. DynIntStack.h: Include required header files. Create a template. Declare a class named “DynIntStack”. Inside the class Inside the “private” access specifier, Give structure declaration for the stack. Create an object for the template. Create a stack pointer name “next”. Create a stack pointer name “top”. Inside the “public” access specifier, Give a declaration for a constructor. Assign null to the top node. Give function declaration for “push ()”, “pop ()”,and “isEmpty()”. Give the class template. Define function definition for “push ()”. Assign null to the new node. Dynamically allocate memory for new node, Assign “num” to the value of new node. Check if the stack is empty using the function “isEmpty ()” If the condition is true then assign new node as the top and make the next node as null. If the condition is not true then, assign top node to the next of new node and assign new node as the top. Give the class template. Define function definition for “pop ()”. Assign null to the temp node. Check if the stack is empty using the function “is_Empty ()” If the condition is true then print “The stack is empty”. If the condition is not true then, Assign top value to the variable “num”. Link top of next node to temp node. Delete the top most node and make temp as the top node. Define function definition for “isEmpty ()”. Assign Boolean value to the variable. Check if the top node is null. Assign true to “status”. Return the status.

Question

Want to see the full answer?

Answer 1

Question

Chapter 18, Problem 5PC

Program Plan Intro

Error Testing

Dynamic Stack:

Program Plan:

Main.cpp:

Include required header files.

Inside the “main ()” function,

Create an object named “dstack” for stack.

Declare a variable named “popElem”.

Push 3 elements inside the stack using the function “push ()”.

Pop 3 elements from the stack using the function “pop ()”.

DynIntStack.h:

Include required header files.

Create a template.

Declare a class named “DynIntStack”. Inside the class

Inside the “private” access specifier,

Give structure declaration for the stack.

Create an object for the template.

Create a stack pointer name “next”.

Create a stack pointer name “top”.

Inside the “public” access specifier,

Give a declaration for a constructor.

Assign null to the top node.

Give function declaration for “push ()”, “pop ()”,and “isEmpty()”.

Give the class template.

Define function definition for “push ()”.

Assign null to the new node.

Dynamically allocate memory for new node,

Assign “num” to the value of new node.

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

If the condition is true then assign new node as the top and make the next node as null.

If the condition is not true then, assign top node to the next of new node and assign new node as the top.

Give the class template.

Define function definition for “pop ()”.

Assign null to the temp node.

Check if the stack is empty using the function “is_Empty ()”

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

If the condition is not true then,

Assign top value to the variable “num”.

Link top of next node to temp node.

Delete the top most node and make temp as the top node.

Define function definition for “isEmpty ()”.

Assign Boolean value to the variable.

Check if the top node is null.

Assign true to “status”.

Return the status.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

for c++ thank you Error Testing The DynIntStack and Dyn IntQueue classes shown in this chapter are abstract data types using a dynamic stack and dynamic queue, respectively. The classes do not cur- rently test for memory allocation errors. Modify the classes so they determine whether new nodes cannot be created by handling the bad_alloc exception. here is the extention.h file please use it #ifndef DYNINTQUEUE_H #define DYNINTQUEUE_H class DynIntQueue { private: // Structure for the queue nodes struct QueueNode { int value; // Value in a node QueueNode *next; // Pointer to the next node }; QueueNode *front; // The front of the queue QueueNode *rear; // The rear of the queue int numItems; // Number of items in the queue public: // Constructor DynIntQueue(); // Destructor ~DynIntQueue(); // Queue operations void enqueue(int); void dequeue(int &); bool isEmpty() const; bool isFull() const; void…

Project 4: Maze Solver (JAVA) The purpose of this assignment is to assess your ability to: Implement stack and queue abstract data types in JAVA Utilize stack and queue structures in a computational problem. For this question, implement a stack and a queue data structure. After testing the class, complete the depth-first search method (provided). The method should indicate whether or not a path was found, and, in the case that a path is found, output the sequence of coordinates from start to end. The following code and related files are provided. Carefully ready the code and documentation before beginning. A MazeCell class that models a cell in the maze. Each MazeCell object contains data for the row and column position of the cell, the next direction to check, and a bool variable that indicates whether or not the cell has already been visited. A Source file that creates the maze and calls your depth-first search method. An input file, maze.in, that may be used for testing. You…

stacks and queues. program must be able to handle all test cases without causing an exception Note that this problem does not require recursion to solve (though you can use that if you wish).