Suppose we want to write a segment of Java code that, given an integer array A and two ints pos1 and pos2, will construct an array B that contains positions pos1 through pos2 from A, but in reverse order. For example, if pos1 is 2, pos2 is 4, and A is: 4, 3, 9, 30, 0, 5 Then the array B will be: 0, 30, 9 Assuming that 0<=pos1<=pos2<=DA.length-1, what will be the length of the array B?

I need the java code for this question ASAP

Write a Java program that reads an integer N from the user and declares an integer array of size N. It then inputs N non-negative integers from the user into the array and do the following: 1. Finds and prints the minimum, maximum, sum, and average of the numbers. 2. Displays array data as a histogram – graphically by plotting each numeric value as a bar of asterisks (*) as shown in the example diagram. This is somehow similar to Lab11 Sample output 9 Enter the size of array: Enter 9 integer values: 10 19 14 Minimum -o Maximum - 19 = 68 Sum Average = 7.55 ========== Histogram: - ------= Element Ualue Hintogran 19 ***** ***** 11

Check if Array Elements are Consecutive in Java. Given an array, we need to check if array contains consecutive elements. For example: Input: array[] = {5, 3, 4, 1, 2} Output: true As array contains consecutive elements from 1 to 5 Input: array[] = {47, 43, 45, 44, 46} Output: true As array contains consecutive elements from 43 to 47 Input: array[] = {6, 7, 5, 6} Output: false As array does not contain consecutive elements.

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;                   }…

I need help with creating a Java program described below: Minesweeper.Write a program that reads three numbers, m, n, and p and produces an m-by-n Booleanarray where each element is occupied with probability p. In the minesweeper game, occupiedcells represent bombs and empty cells represent safe cells.Print out the array using an asterisk for bombs and a period for safe cells.Then, create an integer two-dimensional array with the number of neighboring bombs (above,below, left, right, or diagonal). * * . . . * * 1 0 0. . . . . 3 3 2 0 0 . * . . . 1 * 1 0 0Write your code so that you have as few special cases as possible to deal with, by using an(m+2)-by-(n+2) Boolean array.

Write the following Java program Allocate an array a of ten integers. Put the number 17 as the initial element of the array. Put the number 29 as the last element of the array. Fill the remaining elements with –1. Add 1 to each element of the array. Print all elements of the array, one per line. Print all elements of the array in a single line, separated by commas.

Write a Java program that reads an integer N from the user and declares an integer array of size N. It then inputs N non-negative integers from the user into the array and do the following: 1. Finds and prints the minimum, maximum, sum, and average of the numbers. 2. Displays array data as a histogram – graphically by plotting each numeric value as a bar of asterisks (+) as shown in the example diagram. This is somehow similar to Lab11 Sample output Enter the size of array: 9 Enter 9 integer values: 10 19 5 14 Minimum = Maximum = 19 = 68 = 7.55 Sum Average ========== Histogram: ======= Element Ua lue 10 19 Histogran T T T Arial v T = ABC 3 (12pt) II Com