A recursive helper method “boolean contains(Node start, Object obj)” 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 two object variables of type “Node”. Declare the necessary variables. Define the constructor to create an empty linked list. Define the method “size()” that returns the size of linked list. Define the method “contains() ” to check if the given object is contained in the linked list, Return the function call “contains()” with “2” arguments. Define the method “contains()” that contains “2” arguments, Check if the object is a null value, If it is true, returns false. Check if the object passed is present in the linked list, If it is true, returns true. Return the recursive function call “contains()” with “2” arguments. 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()” , Check if the last index is either “-1” or greater than or equal to the passed argument, assign the value returned from the method “getNode()” to the last value and assign the argument passed, to the last index. Otherwise, assign the value returned from the method “getNode()” with different argument, to the last value and assign the argument passed, to the last index. Define the method “set()” , Get the value returned from the method “getNode()”. Set the new element. 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 conditional expression that contains “contains()” method. Print new line. Print expected result. Print the element returned from the conditional expression that contains “contains()” method. Print new line. Print expected result.

Question

Want to see the full answer?

Answer 1

Question

Chapter 16, Problem 5PP

Program Plan Intro

A recursive helper method “boolean contains(Node start, Object obj)”

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 two object variables of type “Node”.

Declare the necessary variables.

Define the constructor to create an empty linked list.

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

Define the method “contains() ” to check if the given object is contained in the linked list,

Return the function call “contains()” with “2” arguments.

Define the method “contains()” that contains “2” arguments,

Check if the object is a null value,

If it is true, returns false.

Check if the object passed is present in the linked list,

If it is true, returns true.

Return the recursive function call “contains()” with “2” arguments.

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()” ,

Check if the last index is either “-1” or greater than or equal to the passed argument, assign the value returned from the method “getNode()” to the last value and assign the argument passed, to the last index.

Otherwise, assign the value returned from the method “getNode()” with different argument, to the last value and assign the argument passed, to the last index.

Define the method “set()” ,

Get the value returned from the method “getNode()”.

Set the new element.

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 conditional expression that contains “contains()” method.

Print new line.

Print expected result.

Print the element returned from the conditional expression that contains “contains()” method.

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

1. Create a Person.java file. Implement the public Person and Student classes in Person.java, including all the variables and methods in the UMLS. Person -name: String -street: String -city: String +Person(String name, String, street, String, city) +getName(): String +setName(String name): void +getStreet(): String +setStreet(String street): void +getCity(): String +setCity(String City): void +toString(): String Student -Id: int +Person(String name, String, street, String, city, int Id) +getId(): int +setId(int Id): void +toString(): String 2. Create a StudentTest.java file. Implement a public StudentTest class with a main method. In the main method, create one student object and print the object using System.out.println(). Your printing result must follow the example output: name: Mike, street: Morris Ave, city: Union, Id: 1000 Hint: You need to modify the toString methods in the Student class and Person class!

1) Apply the Paint Blue algorithm discussed in class to the following Finite Automata. a a a b b a COIS-3050H-R-W01-2025WI-COMB Formal Languages & Automata a b Show the status of the Finite Automata at the conclusion of the Paint Blue Algorithm (mark the visited states with an X and only include edges that have not been followed). 2) Use the pumping lemma to prove the following language is nonregular: L= {ab} = {abbb, aabbbbbb, aaabbbbbbbbb, ...}

3) Find CFGs that for these regular languages over the alphabet Σ= {a, b}. Draw a Finite Automata e CFG. 1 COIS-3050H-R-W01-2025WI-COMB Formal anguages & Automata Is that contain the substring aba. (b) The language of all words that have an odd number letters and contains the string bb. (c) The language of all words that begin with the substring ba and contains an odd number of letters. 4) Convert the following FA into a PDA. a a S± b a a Ν Ꮓ