Linked List Operations 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, destructor, and member functions in the class. “IntList.cpp”: Include the required header files into the program. 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. Using “if…else” to check whether the list is empty or not, if the list is empty display an appropriate message on the screen. Otherwise, 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 the destructor to destroy the list values from the memory. Declare the structure pointer variables “dataPtr”, and “nextNode” for the structure named “ListNode”. Initialize the variable “dataPtr” with the “head” pointer. Define a “while” loop to make the links of node into “nextNode” and remove the node using “delete” operator. “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, append, and delete operations. Make a call to the function “print” to display all the values in the list on the screen.

Question

Want to see the full answer?

Answer 1

Question

Chapter 18, Problem 2PC

Program Plan Intro

Linked List Operations

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, destructor, and member functions in the class.

“IntList.cpp”:

Include the required header files into the program.

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.

Using “if…else” to check whether the list is empty or not, if the list is empty display an appropriate message on the screen.

Otherwise, 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 the destructor to destroy the list values from the memory.

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

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

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

“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, append, and delete operations.

Make a call to the function “print” to display all the values in the list on the screen.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

In completing this report, you may be required to rely heavily on principles relevant, for example, the Work System, Managerial and Functional Levels, Information and International Systems, and Security. apply Problem Solving Techniques (Think Outside The Box) when completing. should reflect relevance, clarity, and organisation based on research. Your research must be demonstrated by Details from the scenario to support your analysis, Theories from your readings, Three or more scholarly references are required from books, UWIlinc, etc, in-text or narrated citations of at least four (4) references. “Implementation of an Integrated Inventory Management System at Green Fields Manufacturing” Green Fields Manufacturing is a mid-sized company specialising in eco-friendly home and garden products. In recent years, growing demand has exposed the limitations of their fragmented processes and outdated systems. Different departments manage production schedules, raw material requirements, and…

1. Create a Book record that implements the Comparable interface, comparing the Book objects by year - title: String > - author: String - year: int Book + compareTo(other Book: Book): int + toString(): String Submit your source code on Canvas (Copy your code to text box or upload.java file) > Comparable 2. Create a main method in Book record. 1) In the main method, create an array of 2 objects of Book with your choice of title, author, and year. 2) Sort the array by year 3) Print the object. Override the toString in Book to match the example output: @Javadoc Declaration Console X Properties Book [Java Application] /Users/kuan/.p2/pool/plugins/org.eclipse.justj.openjdk.hotspo [Book: year=1901, Book: year=2010]

Q5-The efficiency of a 200 KVA, single phase transformer is 98% when operating at full load 0.8 lagging p.f. the iron losses in the transformer is 2000 watt. Calculate the i) Full load copper losses ii) half load copper losses and efficiency at half load. Ans: 1265.306 watt, 97.186%