Assume the following method is in class TestArrayList (outside the KWArrayList class). What does it do? public static KWArrayList test6Question(KWArrayList list, String item) { if (list.isEmpty0) return; KWArrayList list1 = new KWArayList(): for (int i = 0; i < list.size()/2; i++) { if(list.get(i).compareTo (item) > 0) list1.add(list.get(i): return list1; } The method checks the elements up the half of the "list"; elements that are greater than item, will be added in reverse (A order in "list1". The method returns "list1". The method checks the elements up the half of "this" list; elements that are greater than item, will be added to the end of B "list1". The method returns "list1". The method checks the elements up to the half of the "list"; elements that are greater than item, will be added to the end of "list1". The method returns "list1". The method checks the elements up the half of "this" list; elements that are greater than item, will be added to the first half of the "list", otherwise, it will add it to the end of "list1". The method returns "list1".

Assume the following method is in class TestArrayList (outside the KWArrayList class). What does it do? public static KWArrayList test6Question(KWArrayList list, String item) { if (list.isEmpty0) return; KWArrayList list1 = new KWArayList(): for (int i = 0; i < list.size()/2; i++) { if(list.get(i).compareTo (item) > 0) list1.add(list.get(i): return list1; } The method checks the elements up the half of the "list"; elements that are greater than item, will be added in reverse (A order in "list1". The method returns "list1". The method checks the elements up the half of "this" list; elements that are greater than item, will be added to the end of B "list1". The method returns "list1". The method checks the elements up to the half of the "list"; elements that are greater than item, will be added to the end of "list1". The method returns "list1". The method checks the elements up the half of "this" list; elements that are greater than item, will be added to the first half of the "list", otherwise, it will add it to the end of "list1". The method returns "list1".

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 18RQ

See similar textbooks

Similar questions

Assume the following method is within the KWLinkedList class, what does the following method do? public boolean undefined( ) { ListIterator<E> iter1 = iterator( ); ListIterator<E> iter2 = iterator(size - 1); if (Iter1.hasNext() && iter2.hasPrevious()) { if( iter1.next().equals (iter2.previous()) return true; else return false; } } If the last two elements of the list are equal, then the method will return true, else it will return false. If the first element of the list is same as the last element of the list, then the method will return true else it will return false. If the list is same in the forward and reverse direction, then the method will return true, else it will return false. If the first two elements of the list are equal, then the method will return true, else it will return false.
Write a method called compareSum to be considered in a class outside the KWArrayList class. This method has a parameter list of class type KWArrayList . The method finds the summation of even elements for the first half of list and the summation of odd elements for the second half of list, then compares between the two summations and returns the greater sum. Assume the length of List is even. Method heading: public static int compareSum( KWArrayList<Integer> list) Before run: list= 10 5 50 3 14 33 20 5 (note: the numbers in bold represent the first half) After run: list= 3 5 50 14 33 20 5 Sum1 (for the first half) = 60 Sum2 (for the second half) = 38 Returned value is 60
Assume that the following method is within the KWLinkedList class, what does this method do? public boolean undefined(E item) { if(head == null) return false; Node<E> p = head.next; Node<E> newNode= new Node<E>(item, p); newNode.prev = head; head.next = newNode; p.prev = newNode; size++; return true; } nserts a new node with its data as item at the front of the list. Inserts a new node with its data as item after the first node of the list. Deletes the node with its data as item. Inserts a new node with its data as item, at the end of the list.
If myList is a declared ADT list and the front of the list is on the left, what does the method getEntry(3) return after applying the following pseudo code? myList.add("horse")myList.add("goat")myList.add(1, "fish")myList.add("cat")myList.add(2, "dog")myList.remove(4)goatdoghorsecat
Design and implement a getLastHalf() method for the MyLinkedList class. The method should return the last half of the list as a new list leaving the original list intact. If the list has an uneven number of elements the extra one element must be in the list returned. Example : [1,3,5,4] return [5,4] and [1,6,9] return [6,9]. Follow the three step method for designing the method Develop the java code for the method Create a test program to test the method thoroughly using the Integer wrapper class.
Design and implement a getLastHalf() method for the MyLinkedList class. The method should return the last half of the list as a new list leaving the original list intact. If the list has an uneven number of elements the extra one element must be in the list returned. Example : [1,3,5,4] return [5,4] and [1,6,9] return [6,9]. Follow the three step method for designing the method Develop the java code for the method Create a test program to test the method thoroughly using the Integer wrapper class. public class MyLinkedList<E> { private Node<E> head, tail; public MyLinkedList() { head = null; tail = null; } /** Return the head element in the list */ public E getFirst() { if (head == null) { return null; } else { return head.element; } } /** Return the last element in the list */ public E getLast() { if (head==null) { return null; } else { return tail.element; } } /** Add an element to the beginning of the list */ public void prepend(E e) { Node<E> newNode = new…
Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts public class ItemNode { private String item; private ItemNode nextNodeRef; // Reference to the next node public ItemNode() { item = ""; nextNodeRef = null; } // Constructor public ItemNode(String itemInit) { this.item = itemInit; this.nextNodeRef = null; } // Constructor public ItemNode(String itemInit, ItemNode nextLoc) {…
Create a class of type Generic so that it has a Get method that receive a list regardless of the type of this list. Print the list, remove the first and the last element in the list, reverse the list and finally print the list After modifications. Proposed methodologies:Generic Class. Technologies: - C#- Visual Studio
public class CustomLinkedList { public static int findMax(IntNode headObj) { /* Type your code here */ } public static void main(String[] args) { IntNode headObj; IntNode currObj; IntNode lastObj; int i; int max; // Create head node headObj = new IntNode(-1); lastObj = headObj; // Add nodes to the list for (i = 0; i < 20; ++i) { currObj = new IntNode(i); lastObj.insertAfter(currObj); lastObj = currObj; } max = findMax(headObj); System.out.println(max); }}
Given the IntNode class, define the getCount() method in the CustomLinkedList class that returns the number of items in the list not including the head node. Ex: If the list contains: head -> 14 -> 19 -> 4 getCount(headObj) returns 3. Ex: If the list contains: head -> getCount(headObj) returns 0. public class IntNode { private int dataVal; // Node data private IntNode nextNodePtr; // Reference to the next node // Default constructor public IntNode() { dataVal = 0; nextNodePtr = null; } // Constructor public IntNode(int dataInit) { this.dataVal = dataInit; this.nextNodePtr = null; } // Constructor public IntNode(int dataInit, IntNode nextLoc) { this.dataVal = dataInit; this.nextNodePtr = nextLoc; } /* Insert node after this node. Before: this -- next After: this -- node -- next */ public void insertAfter(IntNode nodeLoc) { IntNode tmpNext; tmpNext = this.nextNodePtr;…
Write methods called min and max that return the smallest and largest values in the list respectively. For example, if a variable called list stores [11, –7, 3, 42, 0, 14] , the call of list.min() should return –7 and the call of list.max() should return 42 . If the list is empty, the methods should throw an IllegalStateException
1- A new static method with one parameter which is a head node for a linked list of integers, the method should create a new linked list which is equivalent to the original list of integers but with all repetitions removed, the method's return value is a head reference for the new list. this is what I have but it's not removing repetitions. public static IntLinkedBag removeRepetition (IntLinkedBag b1) { IntNode next; IntNode head = null; LinkedList<Integer> s = new LinkedList<>(); IntNode new_list = new IntNode(0, null); IntNode now = head; IntNode prev = new_list; while (now!= null) { int x = now.data; if (s.contains(x)) { new_list = new_list.next; } else { s.add(x); new_list.next = new IntNode(x, now); new_list = new_list.next; } now = now.next; } return b1; } }…