A method “boolean contains(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, Check if the object is a null value, If it is true, returns false. Assign first node value to the current node value. Execute till current becomes as a null value, Check the condition, If it is true, returns true. Assign the next node to the current node value. Returns false. 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 4PP

Program Plan Intro

A method “boolean contains(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,

Check if the object is a null value,

If it is true, returns false.

Assign first node value to the current node value.

Execute till current becomes as a null value,

Check the condition,

If it is true, returns true.

Assign the next node to the current node value.

Returns false.

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

Objective: 1. Implement a custom Vector class in C++ that manages dynamic memory efficiently. 2. Demonstrate an understanding of the Big Five by managing deep copies, move semantics, and resource cleanup. 3. Explore the performance trade-offs between heap and stack allocation. Task Description: Part 1: Custom Vector Implementation 1. Create a Vector class that manages a dynamically allocated array. 。 Member Variables: ° T✶ data; // Dynamically allocated array for storage. std::size_t size; // Number of elements currently in the vector. std::size_t capacity; // Maximum number of elements before reallocation is required. 2. Implement the following core member functions: Default Constructor: Initialize an empty vector with no allocated storage. 。 Destructor: Free any dynamically allocated memory. 。 Copy Constructor: Perform a deep copy of the data array. 。 Copy Assignment Operator: Free existing resources and perform a deep copy. Move Constructor: Transfer ownership of the data array…

2.68♦♦ Write code for a function with the following prototype: * Mask with least signficant n bits set to 1 * Examples: n = 6 -> 0x3F, n = 17-> 0x1FFFF * Assume 1 <= n <= w int lower_one_mask (int n); Your function should follow the bit-level integer coding rules Be careful of the case n = W.

Hi-Volt Components You are the IT manager at Hi-Voltage Components, a medium-sized firm that makes specialized circuit boards. Hi-Voltage's largest customer, Green Industries, recently installed a computerized purchasing sys- tem. If Hi-Voltage connects to the purchasing system, Green Industries will be able to submit purchase orders electronically. Although Hi-Voltage has a computerized accounting system, that system is not capable of handling EDI. Tasks 1. What options does Hi-Voltage have for developing a system to connect with Green Industries' pur- chasing system? 2. What terms or concepts describe the proposed computer-to-computer relationship between Hi-Voltage and Green Industries? why not? 3. Would Hi-Voltage's proposed new system be a transaction processing system? Why or 4. Before Hi-Voltage makes a final decision, should the company consider an ERP system? Why or why not?