- swap symmetric off-diagonal elements
- Perform step $1$ for all elements one-after-another
- We will get the same matrix

The Gateway to Computer Science Excellence

+25 votes

Let $A$ be the square matrix of size $n \times n$. Consider the following pseudocode. What is the expected output?

C=100; for i=1 to n do for j=1 to n do { Temp = A[i][j]+C; A[i][j] = A[j][i]; A[j][i] = Temp -C; } for i=1 to n do for j=1 to n do output (A[i][j]);

- The matrix $A$ itself
- Transpose of the matrix $A$
- Adding $100$ to the upper diagonal elements and subtracting $100$ from lower diagonal elements of $A$
- None of the above

+30 votes

Best answer

**A**.

In the computation of given pseudo code for each row and column of Matrix $A$, each upper triangular element will be interchanged by its mirror image in the lower triangular and after that the same lower triangular element will be again re-interchanged by its mirror image in the upper triangular, resulting the final computed Matrix $A$ same as input Matrix $A$.

+23 votes

Take a small matrix

1 2

3 4

now trace the iteration

i=1,j=1 //no change in matrix cz a[i,j]=a[j,i]

i=1,j=2 // resultant matrix

1 3

2 4

i=2,j=1 //resultant matrix

1 2

3 4

i=2,j=2 //no change in matrix cz a[i,j]=a[j,i]

we get the original matrix as it is So, Option A is Ans.

1 2

3 4

now trace the iteration

i=1,j=1 //no change in matrix cz a[i,j]=a[j,i]

i=1,j=2 // resultant matrix

1 3

2 4

i=2,j=1 //resultant matrix

1 2

3 4

i=2,j=2 //no change in matrix cz a[i,j]=a[j,i]

we get the original matrix as it is So, Option A is Ans.

52,375 questions

60,572 answers

201,977 comments

95,388 users