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

#include <stdio.h> #include <stdlib.h> #include <unistd.h> int global_var = 42; // int* function(int *a) { int local_var = 10; // *a = *a + local_var; int *local_pointer = (int *)malloc (size of (int) * 64); // Allocated array with 64 integers return local_pinter; } int main() { int local_main[1024*1024*1024*1024*1024] = {0}; // initialize an array and set all items as 0 int *heap_var = (int *)malloc(size of(int) * 16); // Allocated array with 16 integers *heap_var = 100; function(heap_var); printf(“the value is %d\n”, *heap_var); free(heap_var); // release the memory return 0; } 1) draw the memory layout of the created process, which should include text, data, heap and stack [2 marks]. 2) Indicate which section the variables are allocated [2 marks]: global_var local_var, local_pointer local_main heap_var, *heap_var (the data that it points to) 3) Does this code have memory leaking (heap memory is not released)? [2 marks] 4) The…

8. List three HDD scheduling algorithms. [2 marks] 9. True or False? The NVM has the same scheduling algorithms with HDD. Explain why? [2 marks] 10. Why the modern mouses use polling to detect movements instead of interrupts? [2 marks] 11. What is thrashing? How does it happen? [2 marks] 12. Given a reference string of page numbers 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 and 4 frames show how the page replacement algorithms work, and how many page faults? [6 marks], 1) FIFO algorithm? [2 marks] 2) Optimal algorithm? [2 marks] 3) LRU algorithm? [2 marks] 13. List at least three file systems that you know. [2 marks] 14. In C programming, how the seek to a specific position in the file by offset? [2 marks]

A Personal Address Book application program allows the user to add, delete, search, save, and load contact information. The program separates the user interface (command-line) and the internal processing subsystem. The internal processing system consists of the following classes: • • Contact Manager (responsible for add and delete operations) Contact Finder (responsible for the search operation) pataManager (responsible for save and load operations) a. What design pattern can be used to implement the user interface? Explain your answer using a class diagram for the entire system. b. Draw a UML sequence diagram to show the behavioral view of the Personal Address Book program, demonstrating what happens when a user enters new contact information.