32. What is the behavior of the foxtrot method below? public static double foxtrot (ArrayList list) { } double p = 0.0; for (int item: list) p+= item; double q = p/ list.size(); return q; 32. What is the behavior of the foxtrot method? It returns the sum of the elements in list. It returns the mean of the elements in list. It returns the largest element in list. It returns the smallest element in list It creates an IndexOutOfBoundsException.

32. What is the behavior of the foxtrot method below? public static double foxtrot (ArrayList list) { } double p = 0.0; for (int item: list) p+= item; double q = p/ list.size(); return q; 32. What is the behavior of the foxtrot method? It returns the sum of the elements in list. It returns the mean of the elements in list. It returns the largest element in list. It returns the smallest element in list It creates an IndexOutOfBoundsException.

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

P1.
java program java method: Write a method replace to be included in the class KWLinkedList (for doubly linked list) that accepts two parameters, searchItem and repItem of type E. The method searches for searchItem in the doubly linked list, if found then replace it with repItem and return true. If the searchItem is not found in the doubly linked list, then insert repItem at the end of the linked list and return false. Assume that the list is not empty. You can use ListIterator and its methods to search the searchItem in the list and replace it with repItem if found. Do not call any method of class KWLinkedList to add a new node at the end of the list. Method Heading: public boolean replace(E searchItem, E repItem) Example: searchItem: 15 repItem: 17 List (before method call): 9 10 15 20 4 5 6 List (after method call) : 9 10 17 20 4 5 6
Q2: Write a method to insert an element at index in a Doubly Linked List data structure and test it. The method receives this list by parameters. In Java
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.
Find the index of the first negative numberIntegerListUtils.java import java.util.ArrayList; public class IntegerListUtils { /** * Finds the index of the first negative number in the list. * * @param numbers a list of integers * @return the index of the first negative number, or -1 if no negative number found */ public static int findIndexOfFirstNegative(ArrayList<Integer> numbers) { // complete this method }}
How do you do this? JAVA
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; } }…
Question 2: Linked List Implementation You are going to create and implement a new Linked List class. The Java Class name is "StringLinkedList". The Linked List class only stores 'string' data type. You should not change the name of your Java Class. Your program has to implement the following methods for the StringLinked List Class: 1. push(String e) - adds a string to the beginning of the list (discussed in class) 2. printList() prints the linked list starting from the head (discussed in class) 3. deleteAfter(String e) - deletes the string present after the given string input 'e'. 4. updateToLower() - changes the stored string values in the list to lowercase. 5. concatStr(int p1, int p2) - Retrieves the two strings at given node positions p1 and p2. The retrieved strings are joined as a single string. This new string is then pushed to the list using push() method.
java program : Assume that the following method is added to the class KWLinkedList. What is the functionality of the following method? public E function() { Node<E> temp = tail; tail.prev.next = null; tail = temp.prev; size--; return temp.data; } Return the second last element of the list but do not remove it. Return the second last element of the list and remove it from the list. Return the element at the tail of the list and remove it from the list. Return the element at the tail of the list but do not remove it.
LAB: Finding an integer in a list (singly-linked list) Given main() and an IntNode class, complete the IntList class by writing the append() and search() methods. The search() method should return the IntNode whose data value matches a given key, and null if the key is not found. The search() method should also set the position of each IntNode searched in the IntList, starting with 1. Ex: If the input is: 12 23 59 37 923 2 -1 12 the output is: 12 found in list at position 1. If the input is: 12 23 59 37 923 2 -1 68 the output is: 68 not found in list. ______________________________________ import java.util.Scanner; public class SearchList {public static void main (String[] args) {Scanner scnr = new Scanner(System.in);IntList intList = new IntList();IntNode curNode, foundNode;int num, searchNum;num = scnr.nextInt();while (num != -1) {// Insert into linked listcurNode = new IntNode(num);intList.append(curNode);num = scnr.nextInt();}searchNum = scnr.nextInt();foundNode =…
data structure-JAVA
Please write a Java method as described, not a complete program or class.