Question

this assignment need to be done in java only

Requirements:

• Ask the user to enter the size of an array (int value)
• Allocate a 2D array of int that size (if the user enters in 5, then allocate a 5x5 array)
• Using a Random, initialize each element of the array to be either 0 or 1
• Output the array in a table format (see below for an example)
• Output the fraction of your array that is ones and the fraction that is zeros. For example, suppose the user asked for a 3x3 array and after initialization that array happened to contain 4 ones and 5 zeros. The fraction of ones would be 4/9 and the fraction of zeros would be 5/9.
• Calculate and output the sum of each row. Output the index of the largest row sum.
• Calculate and output the sum of each column. Output the index of the largest column sum.
• Out “rows win” if the largest row sum is greater than the largest column sum. Otherwise, output “columns win”
• Calculate the diagonal sum. Use the diagonal starting at location [0][0] and going down to [N-1][N-1] for an array of size N.
• Output “diagonals rule” if the diagonal sum is greater or equal to the largest row sum and greater than or equal to the largest column sum.
• Below are three example runs.

please comments on the code so i can understand

Answer 1

this is the solution

import java.util.*;
/* create a class named solution*/
class Solution{
    public static void main(String args[]){
        /* declare variables*/
        int n;/*size of the array*/
        int i,j;/*variables to travaerse the array*/
        Scanner s=new Scanner(System.in);
        Random rd = new Random();/* to generate random numbers*/
        System.out.println("Enter the size of the array");
        n=s.nextInt();
        /*to generate an 2d array of random numbers*/
        int arr[][]=new int[n][n];/*2d array named arr of size n*n is created*/
        for(i=0;i<n;i++){
            for(j=0;j<n;j++){
                arr[i][j]=rd.nextInt(2);/* range 2 means from 0 to 1*/
               
            }
        }
        /*to print the nymbers in a tabular form */
        for(i=0;i<n;i++){
            for(j=0;j<n;j++){
                System.out.print(arr[i][j]+" ");
            }
            System.out.println("");
        }

        /*to find the fraction of ones and zeroes*/

        int ones=0;/*stores count of 1's*/
        int zeroes=0;/*stores count of 0's*/
        for(i=0;i<n;i++){
            for(j=0;j<n;j++){
                if(arr[i][j] == 1){
                    ones=ones+1;
                }
                else{
                    zeroes=zeroes+1;
                }
            }
           
        }

        int size=ones+zeroes;/*total number of elements in the array*/
       
        System.out.println("The fraction of ones is "+ones+"/"+size);
        System.out.println("The fraction of zeroes is "+zeroes+"/"+size);
        int rowsum;
       
        int columnsum;
       
        int maxrow=0,index1=0,index2=0;
        /*to find the row sum*/
        for(i=0;i<n;i++){
            rowsum=0;
            for(j=0;j<n;j++){
                rowsum=rowsum+arr[i][j];
               
            }
            System.out.println("the sum of row "+(i+1)+" is "+rowsum);
            /*finding the maximum of the rowsum and storing its index in index 1 and 2*/
            if(rowsum>maxrow){
                maxrow=rowsum;
                index1=i;
                index2=j;
            }
           

        }
        System.out.println("maximum row sum is at the row index "+(index1+1)+" column index "+(index2));
        int maxcolumn=0;
        index1=0;
        index2=0;
        /*finding the maximum of the columnsum and storing its index in index 1 and 2*/
        for(i=0;i<n;i++){
            columnsum=0;
            for(j=0;j<n;j++){
                columnsum=columnsum+arr[j][i];
            }
            System.out.println("the sum of column "+(i+1)+" is "+columnsum);
            if(columnsum>maxcolumn){
                maxcolumn=columnsum;
                index1=i;
                index2=j;
            }
           
        }
        System.out.println("maximum column sum is at the row index"+(index1+1)+" column index"+(index2));

        if(maxrow>maxcolumn){
            System.out.println("rows wins");

        }
        else if(maxrow<maxcolumn){
            System.out.println("column wins");
        }
        else{
            System.out.println("equal");/*there is a occurence where both the rowsum and column sum are equal.so this
                                        will print equal.you can remove if you dont want this*/
        }

        int diagsum=0;
        for(i=0;i<n;i++){
   
                diagsum=diagsum+arr[i][i];/*to add the all diagnol elements*/

        }
        System.out.println("the diagnol sum is "+diagsum);

        if((diagsum>=maxrow) && (diagsum>=maxcolumn)){
            System.out.println("diagnols rules");
        }

    }

}

The out put is