List Reverse Program Plan: “IntList.h”: Include the required specifications into the program. Define a class named “IntList”. Declare the member variables “value” and “*next” in structure named “ListNode”. Declare the constructor, copy constructor, destructor, and member functions in the class. “IntList.cpp”: Include the required header files into the program. Define a copy constructor named “IntList()” which takes an address of object for the “IntList” class as “const”. Declare a structure pointer variable “nodePtr” and initialize it to be “nullptr”. Assign “obj.head” value into the received variable “nodePtr”. Make a “while” loop to copy the received values into “nodePtr”. Make a call to “appendNode()” to insert values to “nodePtr” and initialize address of “next” into “nodePtr”. Define a function named “appendNode()” to insert the node at end of the list. Declare the structure pointer variables “newNode” and “dataPtr” for the structure named “ListNode”. Assign the value “num” to the variable “newNode” and assign null to the variable “newNode”. Using “if…else” condition check whether the list is empty or not, if the “head” is empty then make a new node into “head” pointer. Otherwise, make a loop to find last node in the loop. Assign the value of “dataPtr” into the variable “newNode”. Define a function named “print()” to print the values in the list. Declare the structure pointer “dataPtr” for the structure named “ListNode”. Initialize the variable “dataPtr” with the “head” pointer. Make a loop “while” to display the values of the list. Define a function named “insertNode()” to insert a value into the list. Declare the structure pointer variables “newNode”, “dataPtr”, and “prev” for the structure named “ListNode”. Make a “newNode” value into the received variable value “num”. Use “if…else” condition to check whether the list is empty or not. If the list is empty then initialize “head” pointer with the value of “newNode” variable. Otherwise, make a “while” loop to test whether the “num” value is less than the list values or not. Use “if…else” condition to initialize the value into list. Define a function named “deleteNode()” to delete a value from the list. Declare the structure pointer variables “dataPtr”, and “prev” for the structure named “ListNode”. Use “if…else” condition to check whether the “head” value is equal to “num” or not. Initialize the variable “dataPtr” with the value of the variable “head”. Remove the value using “delete” operator and reassign the “head” value into the “dataPtr”. If the “num” value not equal to the “head” value, then define the “while” loop to assign the “dataPtr” into “prev”. Use “if” condition to delete the “prev” pointer. Define a function named “reverse()” to reverse the values in a list. Declare the pointer variables “newNode”, “newHead”, “nodePtr”, and “tempPtr” for the structure named “ListNode”. Initialize the variable “nodePtr” with the value of the variable “head”. Define a “while” loop to allocate “newNode” variable. Create a “newNode” for the structure “ListNode”. Store the value of “nodePtr” into “newNode” and assign address as null to the “newNode” pointer. Using “if…else” condition swap the values of “newHead” and “newNode”. Assign the address of “next” node into “nodePtr”. Initialize the variable “head” with the value of the variable “newHead”. Define a function named “destroy()” to destroy the list values from the memory. Declare the structure pointer variables “dataPtr”, and “nextNode” for the structure named “ListNode”. Initialize the “head” value into the “dataPtr”. Define a “while” loop to make the links of node into “nextNode” and remove the node using “delete” operator. Define the destructor to call the member function “destroy()” in the list. “Main.cpp”: Include the required header files into the program. Declare an object named “obj” for the class “IntList”. Make a call to functions for insert and append operations. Make a call to the “print()” function to display the list on the screen. Make a call to the “reverse()” function to reverse the order of list and call the “print()” function to display the list values.

Question

Want to see the full answer?

Answer 1

Question

Chapter 18, Problem 4PC

Program Plan Intro

List Reverse

Program Plan:

“IntList.h”:

Include the required specifications into the program.

Define a class named “IntList”.

Declare the member variables “value” and “*next” in structure named “ListNode”.

Declare the constructor, copy constructor, destructor, and member functions in the class.

“IntList.cpp”:

Include the required header files into the program.

Define a copy constructor named “IntList()” which takes an address of object for the “IntList” class as “const”.

Declare a structure pointer variable “nodePtr” and initialize it to be “nullptr”.

Assign “obj.head” value into the received variable “nodePtr”.

Make a “while” loop to copy the received values into “nodePtr”.

Make a call to “appendNode()” to insert values to “nodePtr” and initialize address of “next” into “nodePtr”.

Define a function named “appendNode()” to insert the node at end of the list.

Declare the structure pointer variables “newNode” and “dataPtr” for the structure named “ListNode”.

Assign the value “num” to the variable “newNode” and assign null to the variable “newNode”.

Using “if…else” condition check whether the list is empty or not, if the “head” is empty then make a new node into “head” pointer. Otherwise, make a loop to find last node in the loop.

Assign the value of “dataPtr” into the variable “newNode”.

Define a function named “print()” to print the values in the list.

Declare the structure pointer “dataPtr” for the structure named “ListNode”.

Initialize the variable “dataPtr” with the “head” pointer.

Make a loop “while” to display the values of the list.

Define a function named “insertNode()” to insert a value into the list.

Declare the structure pointer variables “newNode”, “dataPtr”, and “prev” for the structure named “ListNode”.

Make a “newNode” value into the received variable value “num”.

Use “if…else” condition to check whether the list is empty or not.

If the list is empty then initialize “head” pointer with the value of “newNode” variable.

Otherwise, make a “while” loop to test whether the “num” value is less than the list values or not.

Use “if…else” condition to initialize the value into list.

Define a function named “deleteNode()” to delete a value from the list.

Declare the structure pointer variables “dataPtr”, and “prev” for the structure named “ListNode”.

Use “if…else” condition to check whether the “head” value is equal to “num” or not.

Initialize the variable “dataPtr” with the value of the variable “head”.

Remove the value using “delete” operator and reassign the “head” value into the “dataPtr”.

If the “num” value not equal to the “head” value, then define the “while” loop to assign the “dataPtr” into “prev”.

Use “if” condition to delete the “prev” pointer.

Define a function named “reverse()” to reverse the values in a list.

Declare the pointer variables “newNode”, “newHead”, “nodePtr”, and “tempPtr” for the structure named “ListNode”.

Initialize the variable “nodePtr” with the value of the variable “head”.

Define a “while” loop to allocate “newNode” variable.

Create a “newNode” for the structure “ListNode”.

Store the value of “nodePtr” into “newNode” and assign address as null to the “newNode” pointer.

Using “if…else” condition swap the values of “newHead” and “newNode”.

Assign the address of “next” node into “nodePtr”.

Initialize the variable “head” with the value of the variable “newHead”.

Define a function named “destroy()” to destroy the list values from the memory.

Declare the structure pointer variables “dataPtr”, and “nextNode” for the structure named “ListNode”.

Initialize the “head” value into the “dataPtr”.

Define a “while” loop to make the links of node into “nextNode” and remove the node using “delete” operator.

Define the destructor to call the member function “destroy()” in the list.

“Main.cpp”:

Include the required header files into the program.

Declare an object named “obj” for the class “IntList”.

Make a call to functions for insert and append operations.

Make a call to the “print()” function to display the list on the screen.

Make a call to the “reverse()” function to reverse the order of list and call the “print()” function to display the list values.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Consider the following database for some store: Customers (cid, cname, city, discount)Agents (aid, aname, city, percent)Products (pid, pname, city, quantity, price)Orders (ordno, mon, cid, aid, pid, qty, dollars) The relation Customers records the ID (cid), name (cname), location (city) of each customer and a discount percentage (discount) for this customer. The relation Agents records the ID (aid), name (aname), location (city) of each agent and a transaction fee (percent) charged by this agent. The relation Products lists the ID (pid), name (pname), location (city), quantity and price of available products. And finally, the relation Orders contains a unique order number (ordno), the month (mon), customer (cid), agent (aid), product (pid), quantity (qty) of each order as well as the total value (dollars) of the transaction. 1. Express the following query in SQL (a) List customers (names) who do not have discounts but purchased at least one product of price greater than $50. (b) Find…

Consider the following relational schema and briefly answer the questions that follow: Emp(eid: integer, ename: string, age: integer, salary: real) Works(eid: integer, did: integer, pct_time: integer) Dept(did: integer, budget: real, managerid: integer) a. Define a table constraint on Dept that will ensure that all managers have age > 30. b. Write SQL statements to delete all information about employees whose salaries exceed that of the manager of one or more departments that they work in. Be sure to ensure that all the relevant integrity constraints are satisfied after your updates.

Consider the following relations: Student(snum: integer, sname: string, rmajor: string, level: string, age: integer) Class(cname: string, meets_at: time, room: string, fid: integer) Enrolled(snum: integer, cname: string) Faculty(fid: integer, fname: string, deptid: integer) The meaning of these relations is straightforward; for example, Enrolled has one record per student-class pair such that the student is enrolled in the class. 2. Express each of the following integrity constraints in SQL unless it is implied by the primary and foreign key constraint; if so, explain how it is implied. If the constraint cannot be expressed in SQL, say so. For each constraint, state what operations (inserts, deletes, and updates on specific relations) must be monitored to enforce the constraint. (a) Every faculty member must teach at least two courses. (b) Every student must be enrolled in the course called 'Math101'. (c) A student cannot add more than two courses at a time…