Write a method which is passed A[], which is an array of int, and an int passingScore. The method returns the number of items in A[] which are greater than or equal to passingScore.

Write a method which is passed an array of int A[]. The method returns true if A[] is the same backwards and forwards.

Write a method same( ), which is passed two arrays of int. The method returns true if the two arrays contain exactly the same contents.

Write a method called copy, which is passed A[], which is an array of int. The method returns a new array consisting of exactly the same items in A[].

Write a method called copy, which is passed A[], which is an array of int, and an integer n. The method returns a new array consisting of the first n items in A[].

Write a method called slice, which is passed A[], which is an array of int, an integer i and an integer j. The method returns a new array consisting of all of the items in A from A[i] to A[j] inclusive.

Write a method called copy, which is passed A[], which is an array of int, and an integer n. The method returns a new array consisting of all of the items in A[] which are greater or equal to n.

Write a method which is passed an array of int and returns true if the array is sorted in ascending order.

Write a method called generateTriangleNumbers(). This method will take in an integer x and will return an array of integers containing the first x triangle numbers. The nth triangle number is the sum of 1 + 2 + 3 + 4...(n 1) + n.

generateTriangleNumbers(3) returns the array {1,3,6}

generateTriangleNumber(1) returns the array {1}

generateTriangleNumbers(7) returns the array {1, 3, 6, 10, 15, 21, 28}

Write a method which is passed a String and returns the String in reverse.

Write a method which is passed an array of String and modifies it so that all the Strings in the array are reversed. For example, if we pass the array: {"apple", "banana", "racecar", "abc"} the method transforms it to: {"elppa", "ananab", "racecar", "cba"}

Write a method which is passed a two-dimensional array of int row by row. Do not assume that each row has the same number of columns.

Write a method which is passed a two-dimensional array of int column by column.

Implement the method:

/* sets every value in A[][] to initVal */ public static void initialize(int A[][], int initVal) 

Implement the method:

/* returns the largest element in A */ public static int largestItem(int A[][]) 

Implement the method:

/* returns the sum of the row in A that has the largest * sum. */ public static int largestRow(int A[][]) 

Implement the method:

/* Returns column i of A as an array. For example, if */ /* A[][] is: */ /* |-----+-----+-----+-----+-----| */ /* | 10 | 20 | 30 | 40 | 50 | */ /* |-----+-----+-----+-----+-----| */ /* | 60 | 70 | 80 | 90 | 100 | */ /* |-----+-----+-----+-----+-----| */ /* | 110 | 120 | 130 | 140 | 150 | */ /* |-----+-----+-----+-----+-----| */ /* and i is 1, the method returns the array */ /* */ /* |----+----+-----| */ /* | 20 | 70 | 120 | */ /* |----+----+-----| */ /* */ /* You may assume that every row has */ /* the same number of columns. */ public static int[] getCol(int A[][], int i) 

Implement the method:

/* returns the sum of the column in A that has the largest * sum. You may assume that each row has the same number * of columns. */ public static int largestCol(int A[][])