Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Write a Java program that will use a two-dimensional array and modularity to sol

ID: 3692750 • Letter: W

Question

Write a Java program that will use a two-dimensional array and modularity to solve the following tasks: 1. Create a method to generate a 2-dimensional array (random numbers, range 0 - 500). The array has ROW rows and COL columns, where ROW and COL are class constants. 2. Create a method to print the array. 3. Create a method to find the largest element in the array 4. Create a method to find the smallest element in the array 5. Create a method to find the sum of all elements in the array Generate output similar to the sample output below.

Explanation / Answer

Here in the program didnt mentioned about no of rows and columns so I took it as 5.

TwoDimensionalDemo.java

package org.students;

import java.util.Random;

public class TwoDimensionalDemo {
  
//Declaring the constants
public static final int ROW=5;
public static final int COL=5;
   public static void main(String[] args) {
       //Calling the methods
       int[][] array=genRandom();
       printArray(array);
   int max=largest(array);
   int min=smallest(array);
   int sum=sumOfElements(array);
   //Displaying the results
   System.out.println("The Largest Element in the Array is :"+max);
   System.out.println("The Smallest Element in the Array is :"+min);
   System.out.println("The Sum of Elements in the Array is :"+sum);
     

   }
   //Method which Calculate the sum of elements in the array.
   private static int sumOfElements(int[][] array) {
       int sum=0;
       for(int i=0;i<array.length;i++)
       {
           for(int j=0;j<array[i].length;j++)
           {
               sum+=array[i][j];
           }
          
       }
       return sum;
   }
   //Method which find the smallest element in the array
   private static int smallest(int[][] array) {
       int min=0;
       min=array[0][0];
       for(int i=0;i<array.length;i++)
       {
           for(int j=0;j<array[i].length;j++)
           {
               if(array[i][j]<min)
               {
                   min=array[i][j];
               }
           }
          
       }
       return min;
   }
      
   //Method which find the largest Element in the array
   private static int largest(int[][] array) {
       int max=0;
       max=array[0][0];
       for(int i=0;i<array.length;i++)
       {
           for(int j=0;j<array[i].length;j++)
           {
               if(array[i][j]>max)
               {
                   max=array[i][j];
               }
           }
          
       }
       return max;
   }
   //Which which displays the elements in the array.
   private static void printArray(int[][] array) {
       System.out.println("The Elements In the Array are ::");
       for(int i=0;i<array.length;i++)
       {
           for(int j=0;j<array[i].length;j++)
           {
               System.out.print(array[i][j]+" ");
           }
           System.out.println(" ");
       }
      
   }
   //Method which generated the random numbers and stored in an array.
   private static int [][] genRandom() {
       int min=0;
       int max=500;
       Random r = new Random();
       int array[][]=new int[ROW][COL];
       for(int i=0;i<ROW;i++)
       {
           for(int j=0;j<COL;j++)
           {
               array[i][j]=r.nextInt((max - min) + 1) + min;  
           }
              
       }
       return array;
      
   }

}

_______________________________________________________________________________________

output:

The Elements In the Array are ::
79 462 276 178 81

412 291 304 363 80

193 141 52 101 404

459 417 21 74 383

157 213 331 8 460

The Largest Element in the Array is :462
The Smallest Element in the Array is :8
The Sum of Elements in the Array is :5940

________________________________________________________________________________________

Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
Chat Now And Get Quote