Implement a program to achieve the rotation of an n x n image clockwise OR counter-clockwise by 90 degrees. The resolution of the image, n, is entered by the user. You can safely assume that n is no more than 10. The image will be simulated using an n x n 2D matrix, also entered by the user. The input format is as follows an integer n, representing the image resolution matrix, representing the 2D image 0 or 1, representing the clockwise or counter-clockwise rotation EX1: if the user enters 3 123 456 780 0 After rotating the matrix in the clockwise orientation by 90 degrees, the output matrix is 741 852 063

Implement a program to achieve the rotation of an n x n image clockwise OR counter-clockwise by 90 degrees. The resolution of the image, n, is entered by the user. You can safely assume that n is no more than 10. The image will be simulated using an n x n 2D matrix, also entered by the user. The input format is as follows an integer n, representing the image resolution matrix, representing the 2D image 0 or 1, representing the clockwise or counter-clockwise rotation EX1: if the user enters 3 123 456 780 0 After rotating the matrix in the clockwise orientation by 90 degrees, the output matrix is 741 852 063

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

The purpose is to write a program with 2D arrays that will display Knight's Tour. Knight's Tour is a fascinating problem that is done on an electronic chessboard with a knight. Starting at any location on the chessboard, a knight proceeds to move on the board in such a manner that all positions on the chessboard are visited, once and once only. The knight may only move according to the rules of chess playing. The matrixes below show a sequence of knight moves that starts from the top-left corner. In most cases, the knight is locked in place and can go no farther. Note: there are only 3 legal knight moves from the 44 locations and they have already been visited. 01 60 39 34 31 18 09 6438 35 32 61 10 63 30 1759 02 37 40 33 28 19 0836 49 42 27 62 11 16 2943 58 03 50 41 24 07 2048 51 46 55 26 21 12 1557 44 53 04 23 14 25 0652 47 56 45 54 05 22 13 01 22 39 20 03 18 09 1600 37 02 23 08 15 04 1335 40 21 38 19 12 17 1000 00 36 41 24 07 14 0500 34 00 32 00 28 11 2600 00 00 00 42 25 06 2900…
Write a program that prints an mxn matrix whose dimensions are specified by the user. Let the matrix values be random variables. You must use it within the repetition cycle. Example format: Enter dimension of matrix mxn: 2 4 The 2x4 matrix is : 1 2 3 4 5 6 7 8
Write a program that generates a 6x6 two-dimensional matrix filled with 0s and 1s, displays the matrix, and checks to see if every row and every column has an even number of 1s.
Write a program in which the user will create an array of numbers. Take note the user will be the one to decide the number of rows and columns, and will be the onė to input the elemets of the array. Let the program display the matrix. Then, the program must ask the user which one is to display-the minimum or the maximum element of the array.
Write a program that prompts the user to enter the length of a square matrix, randomly fills in 0s and 1s into the matrix, prints the matrix, and finds the rows, columns, and major diagonal with all 0s or all 1s.
A scientist has developed a mathematical model for a physical process, and he wants to check how good is model is. To evaluate the correctness of his model, he wants to test the results of his model under certain parameters and compare them with experimental results. Write a program that first reads the number of tests (testCount) as an int followed by the results of each test according to the model as a double array (test Model) and finally the results of each test according to experiments as a double array (testExperiment). Then, the program should calculate the error of the model by evaluating the average of the squares of the differences between the model result and experimental result (see formula below) using a function. Error Input 1 testCount NOTE: Individual square of the difference between the model value and the experiment value calculations MUST be done in the function. Every other functionality MUST be done in the main function. NOTE: To calculate square of a number you…
You have an integer matrix representing a plot of land, where the value at that location represents the height above sea level. A value of zero indicates water. A pond is a region of water connected vertically, horizontally, or diagonally. The size of the pond is the total number of connected water cells. Write a method to compute the sizes of all ponds in the matrix.EXAMPLEInput:0 2 1 00 1 0 11 1 0 10 1 0 1Output: 2, 4, 1 (in any order)
You have an integer matrix representing a plot of land, where the value at that locationrepresents the height above sea level. A value of zero indicates water. A pond is a region of waterconnected vertically, horizontally, or diagonally. The size of the pond is the total number ofconnected water cells. Write a method to compute the sizes of all ponds in the matrix.EXAMPLEInput:0 2 1 00 1 0 11 1 0 10 1 0 1Output: 2, 4, 1 (in any order)
Using Java, Dr. Choi has 5 students who took a midterm and final. 1.First, she wants to store their midterm and final results in two different 1-dimensional arrays and print each of them to a console. 2.She also wants to find average scores of the midterm and final using loops. 3.Second, she wants to store them in one 2-dimensional array and print it to the console. Each row has test scores of the midterm and final. 4.Modify the program above using a 2-dimensional array: Search the highest test score at midterm and lowest test score at final and print them: Pass an array to a method for finding highest score at midterm and lowest test score at final. There are two methods invoked in main () method. One is for finding the highest score and the other one is for finding the lowest score.
write a program that can create 2 numpy arrays with the size of rows and columns that can be inputted. The contents of each matrix are random integer numbers from -10 to 10 (including -10 and 10). Then do the multiplication operation on the 2 matrices. Finally, find the highest and lowest values of the matrix multiplication result
You have been hired at an open-air mine. You are to write a program to control a digger. For your task, you have been given a 'map' of all the underground resources in the mine. This map comes as a two-dimensional integer array. The array has n rows and k columns. Each integer is between zero and one hundred (inclusive). This array represents a grid map of the mine – with each row representing a different height level. Each square in the grid can contain valuable resources. The value of these resources can go from zero (no resources) to 100 (max resources). The grid maps the resources just below the surface, and down to the lowest diggable depths. The digger starts at the surface (so, just on top of the topmost row in the grid)—at any horizontal position between 1 and k. The digger cannot dig directly downwards, but it can dig diagonally in either direction, left-down, or right-down. In its first time-step, it will dig onto the first row of the grid. In its second time-step, it'll hit…
You have been hired at an open-air mine. You are to write a program to control a digger. For your task, you have been given a 'map' of all the underground resources in the mine. This map comes as atwo-dimensional integer array. The array has n rows and k columns. Each integer is between zero and one hundred (inclusive). This array represents a grid map of the mine – with each row representing a different height level. Each square in the grid can contain valuable resources. The value of these resources can go from zero (no resources) to 100 (max resources). The grid maps the resources just below the surface, and down to the lowest diggable depths. The digger starts at the surface (so, just on top of the topmost row in the grid)—at any horizontal position between 1 and k. The digger cannot dig directly downwards, but it can dig diagonally in either direction, left-down, or right-down. In its first time-step, it will dig onto the first row of the grid. In its second time-step, it'll hit…