public static void fixlt (ArrayList list) { for (int I= 0; I< list.size() ; I +H) if ( list.get(1) % 2=0) list.remove(I) ; Vhat is printed after the following code segment is executed? ArrayList < Integer > list = new ArrayList < Integer > (); for (int i = 1; i< 8, i++) list.add(i); fixlt(list); for(int i = 0; i< list.size(); i++) System.out.print( list.get(i),", "); 1, 3, 5, 7, 1, 3, 5. 1, 2, 3, 4, 5, 6, 7, Error, will not work UESTION 10 en an array is passed to a method it is passed just as any other object would be passed the method has direct access to the original array a reference to the array is passed All of these are true

public static void fixlt (ArrayList list) { for (int I= 0; I< list.size() ; I +H) if ( list.get(1) % 2=0) list.remove(I) ; Vhat is printed after the following code segment is executed? ArrayList < Integer > list = new ArrayList < Integer > (); for (int i = 1; i< 8, i++) list.add(i); fixlt(list); for(int i = 0; i< list.size(); i++) System.out.print( list.get(i),", "); 1, 3, 5, 7, 1, 3, 5. 1, 2, 3, 4, 5, 6, 7, Error, will not work UESTION 10 en an array is passed to a method it is passed just as any other object would be passed the method has direct access to the original array a reference to the array is passed All of these are true

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

Bubble Sort You will change the following method bubbleSort() by using generics and complete only one of three bubbleSort() methods. public int[] bubbleSort(int[] list) {//{2, 9, 5, 4, 8, 1, 6} int i, j, temp = 0; for (i = 0; i < list.length - 1; i++) { for (j = 0; j < list.length - 1 ; j++) { if (list[j] > list[j + 1]) { temp = list[j]; list[j] = list[j + 1]; list[j + 1] = temp; } } } return list; } OPTION 1 public static <E> void bubbleSort(E[] list){ //COMPLETE HERE } OPTION 2 public static<E extends Comparable<E>> void bubbleSort(E[] list){ //COMPLETE HERE } OPTION 3public static<E> void bubbleSort(E[] list, Comparator<? super E> comparator){ //COMPLETE HERE }
Using Java: Write the following method that returns the maximum value in an ArrayList of integers. The method returns null if the list is null or the list size is 0. public static Integer max(ArrayList list) Write a test program that prompts the user to enter a sequence of numbers ending with 0, and invokes this method to return the largest number in the input.
For the following code, indicate the weighted edge values. List<WeightedEdge> list = new ArrayList<>();list.add(new WeightedEdge(1, 2, 3.5));list.add(new WeightedEdge(2, 3, 4.5));WeightedEdge e = java.util.Collections.max(list);e.u = e.v = e.weight =
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) {…
Write the following method that returns themaximum value in an ArrayList of integers. The method returns null if thelist is null or the list size is 0.public static Integer max(ArrayList<Integer> list)Write a test program that prompts the user to enter a sequence of numbers endingwith 0 and invokes this method to return the largest number in the input.
Question: What is the length of the array in MyArrayList after executing the following statements? MyArrayList<Double> list = new MyArrayList<>(); list.add(25.4); list.trimToSize(); list.add(15.4); list.add(35.4); list.add(17.4); list.add(7.4); public class MyArrayList<E> implements MyList<E> { public static final int INITIAL_CAPACITY = 16; private E[] data = (E[])new Object[INITIAL_CAPACITY]; private int size = 0; // Number of elements in the list /** Create an empty list */ public MyArrayList() { } /** Create a list from an array of objects */ public MyArrayList(E[] objects) { for (int i = 0; i < objects.length; i++) add(objects[i]); // Warning: don’t use super(objects)! } @Override /** Add a new element at the specified index */ public void add(int index, E e) { ensureCapacity(); // Move the elements to the right after the specified index for (int…
Suppose that you want an operation for the ADT list that adds an array of items to the end of the list. The header of the method could be as follows: public void addAll( T[ ] items) Write an implementation of this method for the class LinearLinkedList
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;…
Assume that the following method is added to the class KWLinkedList. What does this method do? public boolean question() { if (size%2 == 1 || size < 2) return false; Node<E> h = head; for(int i = 0; i < size/2; i++) h=h.next; Node<E> p = head; while (h!= null) { if (! p.data.equals(h.data)) return false; p = p.next; h = h.next; } return true; } Compare the elements of the first half of the list with the second half, if any one node has the same data value, it will return false, else it will return true. Compare the elements of the first half of the list with the second half, if all the nodes have the same data values, it will return true else, it will return false. Compare the elements of the first half of the list with the second half, if all the nodes have the same data values, it will return false else, it will return true…
java Create a method that takes a list of type integer and find the duplicates. the duplicates are then copied to another list and returned by the method. the header should be public static List<Integer> searchDuplicates(List<Integer> orginalList) the method should work in linear time o(n) NOT o(nlogn) or o(n^2)
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…