File Reverser Program Plan: Main.cpp: Include required header files. Inside “main ()” function, Create an object “file1” for input file stream. Create an object “file2” for output file stream. Declare a class template Declare character variables named “popChar”, and “ch”. Till the end of file, Push each character into the stack using the function “push ()”. Close “file1”. Until the stack gets empty, Pop the character stack and write it on “file2” using the function “pop ()”. Close “file2”. Open “file2”. Till the end of file, Get a character and print it on the console screen. DynStack.h: Include required header files. Create a template. Declare a class named “DynStack”. 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. Give 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. Give 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 node and make temp as the top node. Give 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 19, Problem 9PC

Program Plan Intro

File Reverser

Program Plan:

Main.cpp:

Include required header files.

Inside “main ()” function,

Create an object “file1” for input file stream.

Create an object “file2” for output file stream.

Declare a class template

Declare character variables named “popChar”, and “ch”.

Till the end of file,

Push each character into the stack using the function “push ()”.

Close “file1”.

Until the stack gets empty,

Pop the character stack and write it on “file2” using the function “pop ()”.

Close “file2”.

Open “file2”.

Till the end of file,

Get a character and print it on the console screen.

DynStack.h:

Include required header files.

Create a template.

Declare a class named “DynStack”. 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.

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

Give 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 node and make temp as the top node.

Give 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

Please answer JAVA OOP problem below: Assume you have three data definition classes, Person, Student and Faculty. The Student and Faculty classes extend Person. Given the code snippet below, in Java, complete the method determinePersonTypeCount to print out how many Student and Faculty objects exist within the Person array. You may assume that each object within the Person[] is either referencing a Student or Faculty object. public static void determinePersonTypeCount(Person[] people){ // Place your code here }

Please answer JAVA OOP question below: Consider the following relationship diagram between the Game and VideoGame data defintion classes. Game has a constructor that takes in two parameters, title (String) and cost (double). The VideoGame constructor has an additional parameter, genre (String). In Java, efficiently write the constructors needed within the Game class and VideoGame classes. Hint: Remember to think about the appropriate validation

In a shopping cart, there are various items, which can either belong to the category of household items or electronic items. The following UML diagram illustrates the relationship between items, household items, and electronic items. //Implementation Class public class ShoppingCart{ public static void main(String[] args){ final int MAX_ITEM = 50; Item cart = new Item[MAX_ITEM]; addItem(cart); // populate the item array printItem(cart); } } Considering that all the data definition classes and the implementation class are complete, which of the following Object-Oriented Programming (OOP) concepts do you need to use in the above context? i) Polymorphism ii) Method Overloading iii) Method Overriding iv) Dynamic Binding v) Abstract Class Explain, using course terminology, how you would use any of the above concepts to model the given scenario.