questions are in the pics. thanks! 32. What is the behavior of the foxtrot method below?public static doublefoxtrot(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 listO It creates an IndexOutOfBoundsException. 33. What is the behavior of the waltz method below?public static int waltz(ArrayList list){}int temp = list.get(0);for (int k = 1; k < list.size(); k++)if (list.get(k)

Answered: 32. What is the behavior of the foxtrot…

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 18RQ

See similar textbooks

Related questions

Concept explainers

Question

questions are in the pics. thanks!

32. What is the behavior of the foxtrot method below?
public static double
foxtrot(ArrayList<Integer> 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
O It creates an IndexOutOfBoundsException.

33. What is the behavior of the waltz method below?
public static int waltz(ArrayList<Integer> list)
{
}
int temp = list.get(0);
for (int k = 1; k < list.size(); k++)
if (list.get(k) <temp)
temp = list.get(k);
return temp;
33. What is the behavior of the waltz 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 IndexOutOfBounds Exception.

Expert Solution

Step 1

Given Code:

32.

public static double foxtrot(ArrayList<Integer> list) {
double p = 0.0;

for (int item: list){
p += item;

double q = p / list.size();
return q;
}

33.

public static int waltz (ArrayList<Integer> list) {
int temp = list.get(0);

for (int k = 1; k < list.size(); k++)
if (list.get(k) < temp)
temp = list.get(k);

return temp;
}

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions