Write the exact output that you expect to see on the screen when the indicated statements are executed as part of a complete program. int[] x = (10, 15, 20); arrayProcess (x); System.out.println (x[0] + " + x[2]); public static void arrayProcess (int[] a) { for (int k = 0; k < 3; k++) { a[k] = a[k] + 3; } }

Java

Write a java program (class) called Grades to do the following. Must use an array. Ask the user for 20 grades. Get from the user each grade and fill an array with the grades. Find the average of the elements of the array. Print how many grades are smaller than the average. To get you started, your program code will begin as follows: import java. util. *; //includes Scanner public class Grades { public static void main(String[] args) { //begins main method

public class ArraySection {     static void arraySection(int a[], int b[]) {        int k =  0;        int [] c = new int[a.length];        for(int i = 0; i < a.length; i++) {            for(int j = 0; j < b.length; j++)                if(a[i] == b[j])                    c[k++] = a[i];                                        }        for(int i = 0; i < k; i++)            System.out.println(c[i]);            System.out.println();    }    public static void main(String[] args) {         int a[] = { 1, 2, 3, 4, 5 };        int b[] = { 0, 2, 4,5 };                        arraySection(a,b);        }}   Calculate the algorithm step number and algorithm time complexity of the above program?

Please help with this java problem

write a java-like pseudocode printing how many times integer x appears in an array. the array values are (1,2,1,3,1,1) and x=1.

JAVA:   Using a series of (step by step) diagrams illustrating what is happening in the array, and some words, explain in detail how the binary search would determine if 91 is present in the array below.  (you can copy/paste this array into the answer window).  5  21  39  44  55  61  71  84  93

Write the exact output that you expect to see on the screen when the indicated statements are executed as part of a complete program. int[] array1 = (3, 6, 8, 10, 12); int num = 0; for (int i = 0; i < arrayl.length; i++) { num+ array1 [i]; } System.out.println (num);

Need some help with a Java problem

Write a Java program with a single-dimension array that holds 10 integer numbers and identify the maximum value of the 10 numbers. Next sort the array using a bubble sort and display the array before and after sorting. Psuedocode Generate 10 random integer numbers between 1 and 100 place each random number in a different element of a single-dimension array Display the array's contents unsorted as they are generated Using the bubble sort, sort the array from smallest integer to the largest. //must use the following:    Bubble Sort Code:          public static void bubbleSort(int[] list)          {            int temp;                                               for (int i = list.length - 1; i > 0; i--)              {                 for (int j = 0; j < i; j++)                 {                   if (list[j] > list[j + 1])                   {                   temp = list[j];                   list[j] = list[j + 1];                   list[j + 1] = temp;                   }…