Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Question 1: In this question, you are provided with the class Node that contains a data field (double) and a link field. You are asked to create the class LinkedList with the following instance variables, constructors, and methods: • A private Node instance variable called m first. • A private int instance variable called m numItems. • A constructor that initializes m first to null and numItems to zero. A method called isEmpty to check if the list is empty. • A method called insert to add a new node to a specified position. For example ifinsert (2, 15.5) is invoked on the following linked list: m first 11.5 20.3- 8.7 then the new linked list after the insertion will look like this: m first 11.5 20.3 15.5 8.7 • Your implement should check if the list is empty. • You can create a variable to track the current node, and a variable to track the previous node. • Increment the m numItems every time a node has been inserted to the list. • A method called avg to traverse the list containing double values and return the average. • A method called toString to print every item in the list. • Build a test driver by creating the class TestLinkedList to test the functionality of the class LinkedList. Sample Output: The content of the list is: 27.3 25.5 2.9 1.23 110.4 Average: 33.465999999999994

Question 1: In this question, you are provided with the class Node that contains a data field (double) and a link field. You are asked to create the class LinkedList with the following instance variables, constructors, and methods: • A private Node instance variable called m first. • A private int instance variable called m numItems. • A constructor that initializes m first to null and numItems to zero. A method called isEmpty to check if the list is empty. • A method called insert to add a new node to a specified position. For example ifinsert (2, 15.5) is invoked on the following linked list: m first 11.5 20.3- 8.7 then the new linked list after the insertion will look like this: m first 11.5 20.3 15.5 8.7 • Your implement should check if the list is empty. • You can create a variable to track the current node, and a variable to track the previous node. • Increment the m numItems every time a node has been inserted to the list. • A method called avg to traverse the list containing double values and return the average. • A method called toString to print every item in the list. • Build a test driver by creating the class TestLinkedList to test the functionality of the class LinkedList. Sample Output: The content of the list is: 27.3 25.5 2.9 1.23 110.4 Average: 33.465999999999994

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Question 1: In this question, you are provided with the class Node that contains a data field (double) and a link field. You are asked to create the class LinkedList with the following instance variables, constructors, and methods: • A private Node instance variable called m first. • A private int instance variable called m numItems. A constructor that initializes m first to null and numItems to zero. A method called isEmpty to check if the list is empty. • A method called insert to add a new node to a specified position. For example ifinsert (2, 15.5) is invoked on the following linked list: m first 11.5 20.3- 8.7 then the new linked list after the insertion will look like this: m first 11.5 20.3 15.5 8.7 • Your implement should check if the list is empty. • You can create a variable to track the current node, and a variable to track the previous node. • Increment the m numItems every time a node has been inserted to the list. • A method called avg to traverse the list containing double values and return the average. A method called toString to print every item in the list. • Build a test driver by creating the class TestLinkedList to test the functionality of the class LinkedList. Sample Output: The content of the list is: 27.3 25.5 2.9 1.23 110.4 Average: 33.465999999999994
Transcribed Image Text:Question 1: In this question, you are provided with the class Node that contains a data field (double) and a link field. You are asked to create the class LinkedList with the following instance variables, constructors, and methods: • A private Node instance variable called m first. • A private int instance variable called m numItems. A constructor that initializes m first to null and numItems to zero. A method called isEmpty to check if the list is empty. • A method called insert to add a new node to a specified position. For example ifinsert (2, 15.5) is invoked on the following linked list: m first 11.5 20.3- 8.7 then the new linked list after the insertion will look like this: m first 11.5 20.3 15.5 8.7 • Your implement should check if the list is empty. • You can create a variable to track the current node, and a variable to track the previous node. • Increment the m numItems every time a node has been inserted to the list. • A method called avg to traverse the list containing double values and return the average. A method called toString to print every item in the list. • Build a test driver by creating the class TestLinkedList to test the functionality of the class LinkedList. Sample Output: The content of the list is: 27.3 25.5 2.9 1.23 110.4 Average: 33.465999999999994
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 4 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS