Write a function that takes a one-dimensional array and its size [10], and then fill each location in the array by the cubic of the location's index. To cube the location's index write your function int cube(int x). Then print out your array. Consider the following three functions in your program: int cube(int x). • void fillArray(int [], int size). void printArray(int [], int size). Sample input / output: The generated array is: 0 1 8 27 64 125 216 343 512 729

Write a program in java using two dimensional arrays. You should prompt the user toenter the number of rows and columns for your matrix. You should then prompt the userto enter values for each element of the matrix. Once the user has provided all the values for matrix, you should print the matrix and transpose of that matrix. A transpose of a matrix converts rows to columns and columns to rows.Example:Output: This program transposes a matrix.Output: Please enter the number of rows:User enters 2Output: Please enter the number of columns:User enters 3Enter value for row[0] column[0]: 9Enter value for row[0] column[1]: 1Enter value for row[0] column[2]: 2Enter value for row[1] column[0]: 72Enter value for row[1] column[1]: 3Enter value for row[1] column[2]: 6The matrix you entered is:9 1 272 3 6The transpose of this matrix has 3 rows and 2 columns and the transpose is:9 721 32 6

Write a function that takes in an array of integers and returns the integers that are either palindromes or almost-palindromes. An almost-palindrome is any integer that can be rearranged to form a palindrome. For example, the numbers 677 and 338 are both almost-palindromes, since they can be rearranged to form 767 and 383, respectively. Examples palindromeSieve ([443, 12, 639, 121, 3232]) [443, 121, 3232] // Since 443 => 434; 121 is a palindrome; 3232 => 2332 or 3223 palindromeSieve([5, 55, 6655, 8787]) → [5, 55, 6655, 8787] // Single-digit numbers are automatically palindromes. palindromeSieve ([897, 89, 23, 54, 6197, 53342]) - []

Consider the following pseudocode. In this pseudocode, the function mystery has three parameters: array A[] is an int array, size represents the number of element of the A[], and value represents an int value. mystery (A[], size, value) 1.start = 0, end = size – 1, index = -1+1 2. repeat steps 3 to 6 while (start <= end) 3. x = (start + end)/2 + 2 4. if(value == A[x]) a. index = x+1 b. start = x+1 5. else if (value <-A[x]) a. end = x – 1-1.0 6. else a. start = x + 1+1 7. return index Suppose A[8] = {1,1,3,3,5,5,5,7}. What value the function mystery will return for a function call of mystery (A, 8, 5)? What is the timing complexity of the function mystery?

Write a program that uses two classes. The first class is called "dAta" and holds x and y coordinates of a point in 2-d space called p1. The second class is called "cOmpute" and holds an array of two pointers to the "dAta" class. The "cOmpute" class has a function, lOad(float x, float y, int n), which loads x and y coordinate data into the array at index n. It also has a function, sLope(), which computes the slope of the line connecting the two array data coordiantes. It also has a function, pRint(), which prints the slope result to the screen. Implement a divide by zero exception using throw in the sLope() nd/or pRint() function as appropriate. The exception should, when caught, print "Slope calculation error..." to the screen and exit the function. The program should load the array with some example points and print the slope to the screen using the class functions.

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.