The methods “get()” and “set()” and a recursive helper method “getNode()” Program plan: In a file “ListIterator.java”, create an interface “ListIterator”, Declare the method “next()” that moves the iterator past the next element. Declare the method “hasNext()” that check if there is an element after the iterator position. Declare the method “add()” that adds an element before the position of the iterator and moves the iterator past the added element. Declare the method “remove()” that removes the last traversed element. Declare the method “set()” to set the last traversed element to a previous value. In a file “LinkedList.java”, import the package and create a class “LinkedList”, Declare the object variable. Declare the necessary variable. Define the constructor to create an empty linked list. Define the method “size()” that returns the size of linked list. Define the method “getFirst()” that returns the first element in the linked list. Define the method “removeFirst()” to remove the first element in the linked list. Define the method “addFirst()” that adds an element to the linked list. Define the method “get()” to get the object to the given index. Define the method “set()” to set the object to the given index. Define the method “getNode()”, Check whether the distance is less than or equal to “0” or start contains null value, If it is true, returns start value. Call the method “getNode()” recursively. Define the method “listIterator” of type “ListIterator”, that returns an iterator for iterating through the list. Create a class “Node”, Declare the object variable for “Object”, and “Node”. Create a class “LinkedListIterator”, Declare the necessary object variables. Define the constructor to create an iterator that points to the front of the linked list. Define the method “next()”, If there is no next element then throws an exception. Assign the position to the front of the linked list. Check if position is null, set the first element to the position. Otherwise, set the next position to the current position. Define the method “hasNext()” that check whether there is next element. Define the method “add()”, If position is null, call the method “addFirst()”. Set the first to the position. Otherwise, create a new node. Assign the element to the new node. Set the next position to the next pointer of the new node. Set the new node value to the next position. Set the new node as the position. Increment the size. Set the position to the previous node. Define the method “remove()”, If position is same as the previous, throws an exception. If the position is the first position, call the method “removeFirst()”. Otherwise, set the position to the previous position. Increment the size. Set the previous position to the position. Define the method “set()”, If position is null, throw an exception. Set the value to the position. In a file “ListTest.java”, create a class “ListTest”, Define the “main()” method. Create “LinkedList” object. Add the element “Tony” to the linked list. Add the element “Juliet” to the linked list. Add the element “Harris” to the linked list. Add the element “David” to the linked list. Print the element returned from the method “get()”. Print new line. Print expected result. Call the method “set()” to set the element “Jerry” to “2”. Print the element returned from the method “get()”. Print new line. Print expected result.

Question

Want to see the full answer?

Answer 1

Question

Chapter 16, Problem 2PP

Program Plan Intro

The methods “get()” and “set()” and a recursive helper method “getNode()”

Program plan:

In a file “ListIterator.java”, create an interface “ListIterator”,

Declare the method “next()” that moves the iterator past the next element.

Declare the method “hasNext()” that check if there is an element after the iterator position.

Declare the method “add()” that adds an element before the position of the iterator and moves the iterator past the added element.

Declare the method “remove()” that removes the last traversed element.

Declare the method “set()” to set the last traversed element to a previous value.

In a file “LinkedList.java”, import the package and create a class “LinkedList”,

Declare the object variable.

Declare the necessary variable.

Define the constructor to create an empty linked list.

Define the method “size()” that returns the size of linked list.

Define the method “getFirst()” that returns the first element in the linked list.

Define the method “removeFirst()” to remove the first element in the linked list.

Define the method “addFirst()” that adds an element to the linked list.

Define the method “get()” to get the object to the given index.

Define the method “set()” to set the object to the given index.

Define the method “getNode()”,

Check whether the distance is less than or equal to “0” or start contains null value,

If it is true, returns start value.

Call the method “getNode()” recursively.

Define the method “listIterator” of type “ListIterator”, that returns an iterator for iterating through the list.

Create a class “Node”,

Declare the object variable for “Object”, and “Node”.

Create a class “LinkedListIterator”,

Declare the necessary object variables.

Define the constructor to create an iterator that points to the front of the linked list.

Define the method “next()”,

If there is no next element then throws an exception.

Assign the position to the front of the linked list.

Check if position is null, set the first element to the position.

Otherwise, set the next position to the current position.

Define the method “hasNext()” that check whether there is next element.

Define the method “add()”,

If position is null, call the method “addFirst()”.

Set the first to the position.

Otherwise, create a new node.

Assign the element to the new node.

Set the next position to the next pointer of the new node.

Set the new node value to the next position.

Set the new node as the position.

Increment the size.

Set the position to the previous node.

Define the method “remove()”,

If position is same as the previous, throws an exception.

If the position is the first position, call the method “removeFirst()”.

Otherwise, set the position to the previous position.

Increment the size.

Set the previous position to the position.

Define the method “set()”,

If position is null, throw an exception.

Set the value to the position.

In a file “ListTest.java”, create a class “ListTest”,

Define the “main()” method.

Create “LinkedList” object.

Add the element “Tony” to the linked list.

Add the element “Juliet” to the linked list.

Add the element “Harris” to the linked list.

Add the element “David” to the linked list.

Print the element returned from the method “get()”.

Print new line.

Print expected result.

Call the method “set()” to set the element “Jerry” to “2”.

Print the element returned from the method “get()”.

Print new line.

Print expected result.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

using r language for integration theta = integral 0 to infinity (x^4)*e^(-x^2)/2 dx (1) use the density function of standard normal distribution N(0,1) f(x) = 1/sqrt(2pi) * e^(-x^2)/2 -infinity <x<infinity as importance function and obtain an estimate theta 1 for theta set m=100 for the estimate whatt is the estimate theta 1? (2)use the density function of gamma (r=5 λ=1/2)distribution f(x)=λ^r/Γ(r) x^(r-1)e^(-λx) x>=0 as importance function and obtain an estimate theta 2 for theta set m=1000 fir the estimate what is the estimate theta2? (3) use simulation (repeat 1000 times) to estimate the variance of the estimates theta1 and theta 2 which one has smaller variance?

using r language A continuous random variable X has density function f(x)=1/56(3x^2+4x^3+5x^4).0<=x<=2 (1) secify the density g of the random variable Y you find for the acceptance rejection method. (2) what is the value of c you choose to use for the acceptance rejection method (3) use the acceptance rejection method to generate a random sample of size 1000 from the distribution of X .graph the density histogram of the sample and compare it with the density function f(x)

using r language a continuous random variable X has density function f(x)=1/4x^3e^-(pi/2)^4,x>=0 derive the probability inverse transformation F^(-1)x where F(x) is the cdf of the random variable X