1 2 3 4 5 6 7 8 9 H Here we will explore on ways...

  

Transcribed Image Text:

1 2 3 4 5 6 7 8 9 H Here we will explore on ways to do a clock-wise rotation of an example bit-map representation of an image aka A Matrix. Below is the matrix : Our objective is to write (a) function(s) to rotate the above matrix by 90- degrees clockwise which produces the matrix as below: [74 8 9 52 3 We will solve the problem in two ways:- (1) [50 points] Implement the function by allocating a new n X n 2D array. Then write the rotation to it by writing the rows of the original matrix to the columns in the solution matrix such that they fit the solution require- ment. Then copy the new matrix exactly the same to the original matrix so that you know for sure you have updated the original matrix to look modified. (2) [50 points] Implement the function without allocating a new n X n 2D array. Hint: first exchange elements in top row to bottom row, then swap the sym- metry elements at [i][j] with [j][i] where i represents rows and j represents columns. 1 2 3 4 5 6 7 8 9 H Here we will explore on ways to do a clock-wise rotation of an example bit-map representation of an image aka A Matrix. Below is the matrix : Our objective is to write (a) function(s) to rotate the above matrix by 90- degrees clockwise which produces the matrix as below: [74 8 9 52 3 We will solve the problem in two ways:- (1) [50 points] Implement the function by allocating a new n X n 2D array. Then write the rotation to it by writing the rows of the original matrix to the columns in the solution matrix such that they fit the solution require- ment. Then copy the new matrix exactly the same to the original matrix so that you know for sure you have updated the original matrix to look modified. (2) [50 points] Implement the function without allocating a new n X n 2D array. Hint: first exchange elements in top row to bottom row, then swap the sym- metry elements at [i][j] with [j][i] where i represents rows and j represents columns.