Module: एपी कंप्यूटर साइंस सेक्शन II 2015

import java.io.*;
import java.util.*;

public class Main
{
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
         int n = in.nextInt();
        int[] arr = new int[n];
        for(int i = 0;i< n;i++)
        {
            int b = in.nextInt();
            arr[i] = b;
        }
        
        ArrayUtil.reverseArray(arr);

        for(int i = 0;i< n;i++)
        {
            System.out.print(arr[i]+" "); 
        }
        System.out.println();
        n = in.nextInt();
        int m = in.nextInt();
        int[][] arr2 = new int[n][m];
       
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++) {
                int b = in.nextInt();
                arr2[i][j] = b;
            }

        Matrix matrix = new Matrix(arr2);
        matrix.reverseAllRows();
        printArray(arr2, n, m);
        matrix.reverseMatrix();
        printArray(arr2, n, m);
       
    }

 static void printArray(int[][] arr, int n, int m)
  {  
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                System.out.print(arr[i][j] + " ");
            }
            System.out.println();
        }

  }

}
  class ArrayUtil
 {
  /** Reverses elements of array arr.
  * Precondition: arr.length > 0.
  * Postcondition: The elements of arr have been reversed.
  * @param arr the array to manipulate
  */
public static void reverseArray(int[] arr)
{ /* to be implemented in part (a) */ 
//Other methods are not shown.            

 }
}     

class Matrix
{
private int[][] mat;
/** Constructs a matrix of integers. */
public Matrix (int[][] m)
{ mat = m; }
/** Reverses the elements in each row of mat.
* Postcondition: The elements in each row have been reversed.
*/
public void reverseAllRows()
{ /* to be implemented in part (b) */            

}
/** Reverses the elements of mat.
* Postcondition:
* - The final elements of mat, when read in row-major order,
* are the same as the original elements of mat when read
* from the bottom corner, right to left, going upward.
* - mat[0][0] contains what was originally the last element.
* - mat[mat.length-1][mat[0].length-1] contains what was
* originally the first element.
*/
public void reverseMatrix()
{ /* to be implemented in part (c) */            

  }
//Other instance variables, constructors and methods are not shown.
}