Solve using java Assume the following method is outside the class of KWArrayList class but has access to the methods of KWArrayList class, whatdoes it do?public static void Unknown(KWArrayList list1, KWarrayList list2){if (list1.size() == 0 || list2.size() ==0) return;int loop;if (list1.size() < list2.size())loop= list1.size();else loop= list2.size():for (int i=0; i

In the given program ,when we consider so we saw that things. =============================== 1.…

ssume the following method is outside the class of KWArrayList class but has access to the methods of KWArrayList class, what oes it do? public static void Unknown(KWArrayList list1, KWarrayList list2) { if (list1.size() == 0 || list2.size() ==0) return; int loop: if (list1.size() < list2.size()) loop= list1.size(); else loop= list2.size(); for (int i=0; i

ssume the following method is outside the class of KWArrayList class but has access to the methods of KWArrayList class, what oes it do? public static void Unknown(KWArrayList list1, KWarrayList list2) { if (list1.size() == 0 || list2.size() ==0) return; int loop: if (list1.size() < list2.size()) loop= list1.size(); else loop= list2.size(); for (int i=0; i

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 outside the class of KWArrayList class but has access to the methods of KWArrayList class public static void Unknown(KWArrayList<Integer> list1, KWarrayList<Integer> list2) { if (list1.size() == 0 || list2.size() ==0) return; int loop; if (list1.size() < list2.size()) loop= list1.size(); else loop= list2.size(); for (int i=0; i<loop; i++) list1.set(i,(Integer) list1.get(i) + (Integer) list2.get(i)) }
Given the IntNode class, define the findMax() method in the CustomLinkedList class that returns the largest value in the list or returns -99 if the list is empty. Assume all values in the list are non-negative. Ex: If the list contains: head -> 14 -> 191 -> 186 -> 181 findMax(headObj) returns 191. Ex: If the list contains: head -> findMax(headObj) returns -99. public class CustomLinkedList { public static int findMax(IntNode headObj) { if (headObj.getNext() == null) { return -99; // List is empty } int max = headObj.getNext().getData(); IntNode current = headObj.getNext().getNext(); // Traverse the linked list to find the maximum value while (current != null) { int data = current.getData(); if (data > max) { max = data; } current = current.getNext(); } return max; } public static void main(String[] args) { IntNode headObj;…
Question 5 Assume that the following method is in a class called DLL (not same as KWLinkedList). What does this method do? public void method_LI( ) { KWLinkedList<Integer> list = new KWLinkedList<Integer>( ); list.add(2); list.add(-1); list.add(0); list.add(1); list.add(0); ListIterator<integer> iter = list.listIterator(); while(iter.hasNext()) { if (iter.next() == 0) iter.remove(); } if( iter.hasPrevious() ) System.out.println("END"); else while(iter.hasNext()) System.out.print(iter.next() + " "); } Removes the nodes having 0 as its data and prints END. Removes the nodes having 0 as its data and prints 2 -1 1 Removes the nodes having 0 as its data and prints 1 -1 2 Prints 2 -1 0 1 0 without removing anything.
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.
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 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 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
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); }}
using arrays or Arraylist in java language don't use Scanner class Write the method named examScore().* * The "key" list contains the correct answers * to an exam, like ["a", "a", "b", "b"]. The "answers" * list contains a student's answers, with "?" representing * a question left blank. The two lists are not empty and * are the same length. Return the score for this list * of answers, giving +4 for each correct answer, -1 for * each incorrect answer, and +0 for each blank answer.* * Examples:* examScore(["a", "a", "b", "b"], ["a", "c", "b", "c"]) returns 6* examScore(["a", "a", "b", "b"], ["a", "a", "b", "c"]) returns 11* examScore(["a", "a", "b", "b"], ["a", "a", "b", "b"]) returns 16* * @param key a list of correct answers to an exam.* @param answers the student's answers to the exam.* @return the score as described above.
Exercise 1 If your first name starts with a letter from A-J inclusively: Add a method swapTwoNodes to SinglyLinkedList class from week 2 lecture examples. This method should swap two nodes node1 and node2 (and not just their contents) given references only to node1 and node2. The new method should check if node1 and node2 are the same node, etc. Write the main method to test the swapTwoNodes method. Hint: You may need to traverse the list. If your first name starts with a letter from K-Z inclusively: Add a method swapTwoNodes to DoublyLinkedList class from week 2 lecture examples. This method should swap two nodes node1 and node2 (and not just their contents) given references only to node1 and node2. The new method should check if node1 and node2 are the same node, etc. Write the main method to test the swapTwoNodes method. Hint: You may need to traverse the list.…
Refactore UIMenuBuilder/UIFormBuilder to remove redundant and copied code. public final class UIFormBuilder {private final List<Pair> _menu = new ArrayList<Pair>();public void add(String prompt, UIFormTest test) {_menu.add(new Pair<String, UIFormTest>(prompt, test));}public UIForm toUIForm(String heading) {if (null == heading)throw new IllegalArgumentException();if (_menu.size() < 1)throw new IllegalStateException();Pair[] array = new Pair[_menu.size()];for (int i = 0; i < _menu.size(); i++)array[i] = _menu.get(i);return new UIForm(heading, array);}} public class UIMenuBuilder { private final List<Pair<String,UIMenuAction>> _menu; public UIMenuBuilder() { _menu = new ArrayList<Pair<String,UIMenuAction>>(); } public UIMenu toUIMenu(String heading) { if (null == heading) throw new IllegalArgumentException(); if (_menu.size() <= 1) throw new IllegalStateException();…