Write a static method rotateMatrix that accepts a two-dimensional (2D) integer array as square matrix NxN (i.e., N rows and N columns), and returns a 2D integer array as square matrix after rotating the input matrix by 90 degrees in clockwise direction. For example, if input 4x4 integer matrix is: {{1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12}, {13, 14, 15, 16}} After rotation, rotateMatrix should return the following 2D integer array: {{13, 9, 5, 1}, {14, 10, 6, 2}, {15, 11, 7, 3}, {16, 12, 8, 4}} For example, if input 2x2 integer matrix is: {{1, 2}, {5, 6}} After rotation, rotateMatrix should return the following 2D integer array: {{5, 1}, {6, 2}} Note: NxN matrix is declared as "int array_name[N][N];". E.g., 4x4 matrix would be "int array_name[4][4];".

Write a static method rotateMatrix that accepts a two-dimensional (2D) integer array as square matrix NxN (i.e., N rows and N columns), and returns a 2D integer array as square matrix after rotating the input matrix by 90 degrees in clockwise direction. For example, if input 4x4 integer matrix is: {{1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12}, {13, 14, 15, 16}} After rotation, rotateMatrix should return the following 2D integer array: {{13, 9, 5, 1}, {14, 10, 6, 2}, {15, 11, 7, 3}, {16, 12, 8, 4}} For example, if input 2x2 integer matrix is: {{1, 2}, {5, 6}} After rotation, rotateMatrix should return the following 2D integer array: {{5, 1}, {6, 2}} Note: NxN matrix is declared as "int array_name[N][N];". E.g., 4x4 matrix would be "int array_name[4][4];".

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Write a program that randomly fills in 0s and 1sinto an n-by-n matrix, prints the matrix, and finds the rows and columns with themost 1s. Here is a sample run of the program: Enter the array size n: 4 ↵EnterThe random array is0011001111011010The largest row index: 2The largest column index: 2, 3
Write a Java program that includes in its class the following methods:- A method named unitMatrix which takes one parameter which is an integer (n) and - ‏prints a unit matrix of dimension (nxn). A unit matrix is a square matrix in which the - ‏diagonal elements are all 1s and the remaining elements are 0s.- ‏For example for n = 3 the printed unit matrix should be:- ‏1 0 0 - ‏0 1 0- ‏0 0 1- ‏- A method named triangularMatrix which takes two parameters. The first parameter is - ‏an integer (n) which specifies the dimensions of the triangular matrix to be printed - ‏(nxn). The second parameter is a boolean which specifies the type of the triangular - ‏matrix: if its value is true, the printed matrix must be an upper triangular matrix- ‏(square elements with all elements below the diagonal are 0s), if its value is false the - ‏printed matrix must be a lower triangular matrix (square elements with all elements - ‏above the diagonal are 0s). - ‏The values of non-zero elements must start…
In java language using arrays This method examines the two-dimensional array of integersidentified by the first parameter, whose length (number of rows,also the number of students) is the second parameter, while thethree columns in the array represent the scores for threedifferent tests.The test scores for each student (one row of three grades) arecombined to find the average score for each student. The integerreturned is the number of students with a test average less than 70. @param numStudents, the number of students who took the three tests@param theArray, a 2-D array of integer scores@return, the number of test averages below a score of 70*/public static int testAverage(double[][] theArray, int numStudents){int NUM_TESTS = 3; // your work here // loop though theArray, computing each student's average // your work here// return count of averages below 70.0 // your work here
Write the method sum2D() which accepts a two dimensional integer array and returns the sum of all the elements of the array.
Consider the following method. /** Postcondition: m is displayed in a rectangular matrix for example: 1 2 3 4 5 6 7 8 public static void displayMatrix (int [] [] m) for (int r = 0; r < m.length; r++) for (int c = 0; c < m.length; c++) System.out.print (m[r] [c] + " "); System.out.println (); Will method displayMatrixsatisfy its postcondition? Yes, but only if the row-size and col-size are identical, No, all the numbers will display in one column. Yes, all the numbers will display in a correct rectangular display. No, because the code will generate an IndexArrayoutofBoundsException error. No, all the numbers will display in one row. ОООО О
Write a method that takes a rectangular two-dimensional array of type int. The method returns true if the sum of the even elements of the parameter array are larger than the sum of the odd elements, otherwise the method returns false. public static boolean sum(int[]0 in) Taken array Result 1 -3 17 5 -2 30 true 1 3 -1 -1 -3 -4 7 -1 10 false -1 3 -4 15
The rotateLeft method takes an array of integers, and an integer number of places, and returns a new copy of the array that contains a "rotated" version of the input array. Rotation means that elements have been shifted leftwards by that number of places, moving elements off one end of the array and onto the other end. For example, [11, 12, 13, 14, 15] rotated left by 2 places results in [13, 14, 15, 11, 12].
Write a method that returns the intersecting point oftwo lines. Assume that (x1, y1) and (x2, y2) are thetwo points on line 1 and (x3, y3) and (x4, y4) are on line 2. The method header is:public static double[] getIntersectingPoint(double[][] points)The points are stored in a 4-by-2 two-dimensional array points with (points[0][0], points[0][1]) for (x1, y1). The method returns the intersecting pointor null if the two lines are parallel. Write a program that prompts the user to enterfour points and displays the intersecting point.
Write a program in java that randomly fills in 0s and 1s into an n-by-n matrix, prints the matrix, and finds the rows and columns with the most 1s. (Hint: Use two ArrayLists to store the row and column indices with the most 1s.)
Suppose that you are playing a card game whose goal is to collect exactly k cards with a total value of t. Write a solution that can determine if it is possible for a given collection of cards whose values are given in the array values. For example, if the array contained the values <10,5,7,2>, k = 3, and t = 12, you would return false because no three values add to 12. However, if t = 14, you would return true, since 5 + 7 + 2 = 14. So I considered this to be a form of groupSum recursion, so I try to implement it in recursion form. However, since the passing parameters are not the incrementing level index but 'k' that is the limit number of the numbers we can choose from the array, I cannot use passing index through recursion to search from the start of the array toward the end of the values.length(the length of the array). would there be any method I can use to increment and search along the array using k, the number of numbers we can add into the total(t) instead of the…
Write a program that fills an integer array of size 1000 with random positive integers between 1 and 10.Assume that each element represents a different city and the integers stored in the array represent thenumber of golds in those cities. The program traverses over the array and collects the golds at each city,starting from a random position. When the program visits a certain city, all of the golds are collected,and the visited element of the array becomes 0 (no gold is left at that city.) The journey continues withthe rule given below. If the position at the nth step is denoted by pn, and the number of golds at the citypn is denoted by gn,??+1 = {| ((??−1 + ?? + ??) ???1000|, ????? 2 = 0| ((??−1 + ?? − ??) ???1000|, ????? 2 = 1.The program continues visiting cities until the last three visited city has no gold.The program, at each visit, should print out the following information:• The current city index (pn).• The previous city index (pn-1).• The number of golds at the current city…
Write a method that shuffles the rows in a two-dimensional intarray using the following header:public static void shuffle(int[][] m)Write a test program that shuffles the following matrix:int[ ][ ] m = {{1, 2}, {3, 4}, {5, 6}, {7, 8}, {9, 10}};