Question

Create a class called Lab7b and in it implement all of the methods below. Also, write a main method with test calls to all of these methods. Don’t forget to turn in your file to Canvas before the end of the lab today.

1. int[][] random(int N, int start, int end) returns an N-by-N matrix of random integers ranging from start to end;

2. int rowSum(int[][] a, int i) returns the sum of the elements in row i of the 2-D array a;

3. int colSum(int[][] a, int j) returns the sum of the elements in column j of the 2-D array a;

4. boolean isSquare(int[][] a) returns true if the 2-D array a is square (i.e. the number of rows and columns are the same);

5. boolean isLatin(int[][] a) returns true if the 2-D array a is a Latin square (i.e. an n-by-n matrix such that each row and each column contains the values from 1 through n with no repeats);

6. main(String[] args): the main method should test each method above on five randomly generated matrices and also these ones:

       int[][] allneg = { {-10,-12,-3}, {-4,-5,-6,-8}, {-7,-8} };
       int[][] nonsquare ={ {1,2,3}, {4,5}, {6,7,8,9} };
       int[][] latin = { {1,2,3}, {2,3,1}, {3,1,2} };
       int[][] notlatin = { {2,1,3}, {2,3,1}, {3,1,2} };

7. Write a program ShiftNumbers.java that takes integer M as the number of both rows and columns for your 2D array. Create the same exact following 2D array.

Note: The borders are produced at the time of printing. You also need to shift the numbers for each row of the 2D array as displayed below:

    +-+-+-+-+-+
    |1|2|3|4|5|
    +-+-+-+-+-+
    |2|3|4|5|1|
    +-+-+-+-+-+
    |3|4|5|1|2|
    +-+-+-+-+-+
    |4|5|1|2|3|
    +-+-+-+-+-+
    |5|1|2|3|4|
    +-+-+-+-+-+

Answer 1

File Edit Selection Find View Goto Tools Project Preferences Help { } } } import java.util.*; import java.util .; import java.util.*; 2 public class Lab9 3 4 public static int[][] random(int n, int start, int end){ 5 int[][] array = new int[N][N]; 6 Random r= new Random(); 7 for(int i=0;i<N;i++){ 8 for(int j=0; j<n; j++){ 9 int rand = r.nextInt(end-start) + start; 10 /* generate random number from start(inclusive) to end(exclusive)*/ 11 array[i][j]=rand; 12 System.out.print(array[i][j]+" "); 13 14 System.out.println(); 15 16 return array; 17 18 public static int rowSum(int[][] a, int i) { 19 int answer=0; 20 l/iterate over the row and calculate sum 21 for(int j=0; j<a[i].length;j++) 22 answer+=a[i][j]; 23 return answer; 24 25 public static int colSum(int[][] a, int j){ 26 int answer=0; 27 l/iterate over the column and calculate sum 28 for(int i=0; i<a.length; i++) 29 answer+=a[i][j]; 30 return answer; 31 32 public static boolean isSquare(int[][] a) { 33 int rowlength=a[0].length; 34 //iterate over each row and check if number of columns are same 20. for Gint izguizacal length-ju). Line 6 Column 24 } } Spaces: 3 Plain Text

File Edit Selection Find View Goto Tools Project Preferences Help } } import java.util.*; import java.util."; ----...-.-.-.-. 35 for(int i=0;i<a[@].length;i++){ 36 if(a[i].length!=rowlength) 37 return false; 38 39 return true; 40 41 public static boolean isLatin(int[][] a){ 42 if(!isSquare(a)) return false; 43 HashSet<Integer> set=new HashSet(); 44 1/check rowwise first if the numbers are all distinct and in sequence 45 for(int i=0;i<a.length;i++){ 46 //populate hashset the numbers between 1 and n 47 for(int c=1;C<=a.length;c++) 48 set.add(c); 49 /*remove from hashset and check if it empties the set 50 if yes the it is a latin row 51 else return false 52 */ 53 for(int j=0; j<a.length;j++){ 54 if(!set.contains(a[i][j])) return false; 55 set.remove(a[i][j]); 56 57 if(set.size() !=0) return false; 58 59 //check columnwise first if the numbers are all distinct and in sequence 60 for(int i=0;i<a.length;i++){ 61 //populate hashset the numbers between 1 and n 62 for(int c=1;c<=a.length;C++) 63 set.add(c); 64 /*remove from hashset and check if it empties the set 65 if yes the it is a latin column 66 else return false 67 */ 68 for(int j=0; j<a.length;j++){ O Line 6 Column 24 } } Spaces: 3 Plain Text

File Edit Selection Find View Goto Tools Project Preferences Help import java.util."; import java.util.; if(!set.contains(a[j][i])) return false; set.remove(a[j][i]); } if(set.size() !=0) return false; } return true; } 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 public static void main(String[] args) { int[][] ar= random(5 , 1 ,11); System.out.println("Testing random array"); System.out.println("rowSum "+rowSum(ar,1)); //the indexing starts from o System.out.println("colSum "+colSum(ar,1)); //the indexing starts from o System.out.println("isSquare? + isSquare(ar)); System.out.println("isLatin? " + isLatin(ar)); int[][] allNeg={{-10,-12,-3},{-4,-5,-6,-8},{-7,-8}}; int[][] nonSquare={{1,2,3},{4,5},{3,1,2}}; int[][] latin={{1,2,3},{2,3,1},{3,1,2}}; int[][] nonLatin={{2,1,3},{2,3,1},{3,1,2}}; System.out.println("Testing allveg array"); System.out.println("rowSum "+rowSum(allNeg,1)); //the indexing starts from O System.out.println("colSum "+colSum(allveg, 1)); //the indexing starts from o System.out.println("isSquare? " + isSquare(allNeg)); System.out.println("isLatin? " + isLatin(allNeg)); System.out.println("Testing nonSquare array"); System.out.println("rowSum "+rowSum(nonSquare,1)); //the indexing starts from o System.out.println("colSum "+colSum(nonSquare,1)); //the indexing starts from o System.out.println("isSquare? " + isSquare(nonSquare)); System.out.println("isLatin?" + isLatin(nonSquare)); System.out.println("Testing latin array"); System.out.println("rowSum "+rowSum(latin, 1)); //the indexing starts from System.out.println("colSum "+colSum(latin, 1)); //the indexing starts from System.out.println("isSquare? " + isSquare(latin)); System.out.println("isLatin?" + isLatin(latin)); System.out.println("Testing nonlatin array"); Line 6 Column 24 Spaces: 3 Plain Text

File Edit Selection Find View Goto Tools Project Preferences Help ILOV. 103 104 105 106 107 108 import java.util.; import java.util."; ---...ver.p. --- System.out.println("rowSum "+rowSum(nonLatin,1)); //the indexing starts from o System.out.println("colSum "+colSum(nonLatin, 1)); //the indexing starts from o System.out.println("isSquare? " + isSquare(nonLatin)); System.out.println("isLatin?" + isLatin(nonLatin)); } }

Result CPU Time: 0.24 sec(s), Memory: 35632 kilobyte(s) 3 10 6 39 4 7 8 38 484 76 8 5 1 88 1 3 10 6 2 colsum -25 " Testing random array rowSum 30 colSum 33 isSquare? true isLatin? false Testing allNeg array rowSum -23 - isSquare? false isLatin? false Testing nonSquare array rowSum colSum 8 isSquare? false isLatin? false Testing latin array rowSum 6 colSum 6 isSquare? true isLatin? true Testing nonlatin array rowSum 6 colSum 5 isSquare? true isLatin? false

Program for  ShiftNumbers.java