811 views
3 votes
3 votes
Assume that there are two lower triangular matrices P and Q of size $m\times m$.If matrix P and transpose of Q are fit into rectangular matrix R of size $m\times\left ( m+1 \right )$

then

(A) R[i,j+1]=Q[i,j]

(B) R[j,i+1]=Q[i,j]

(C) R[j+1,i]=Q[i,j]

(D)None of above

2 Answers

Best answer
1 votes
1 votes

First we do transpose of Q here . 

So Q[j,i]  =   Q[i,j] 

Now after doing transpose operation , Q has become upper triangular matrix . 

Now the thing is contents of lower triangular matrix P will remain as it is in the R , so the indices of P will remain as it is in R as well.. 

As a result we have to store the elements of Q one column right in R w.r.t to original column in upper triangular matrix Q .

Hence

R[j,i+1]   =   Q[j,i]   where Q[j,i] represents element of upper triangular matrix Q after doing transpose operation on it.Thus w.r.t. original matrix Q which is lower triangular matrix : 

R[j,i+1]   =   Q[i,j] 

Hence B) should be the correct option .

selected by

Related questions

0 votes
0 votes
1 answer
2
kickassakash asked Jul 4, 2023
420 views
I have specific doubt on this question and I’ve tried to explain that in the picture ,If anyone can explain it then it’ll be of great help. according to sachin sir th...
0 votes
0 votes
1 answer
3
Souvik33 asked Apr 2, 2023
428 views
There are Insert and Retrieve_Max operations on a set {}. for n such operations what is the time complexity of the efficient algorithm possible?$n^{2}$nlogn n logn
0 votes
0 votes
1 answer
4
Souvik33 asked Nov 2, 2022
864 views
Which data structure would be most appropriate to implement a collection of values with the following 3 characteristicsSingly link list with head and tail pointerDoubly l...