search
Log In
1 vote
361 views
Assume that there are two lower triangular matrices A and B of size n*n. If matrix A and transpose of B are fit into a rectangular matrix C of size n*(n+1), then
a) B[i,j]=C[i,j+1]
b)B[i,j]=C[j+1,i]
c)B[i,j]=C[j, i+1]
in Programming 361 views
0
I do not think that this problem is complete. Please write complete problem dude.
0
The question is correct

 It was asked in jnuee-2009 and its answer isc

But how?
0
i am able to understand even question here. can anyone make it easy for me?

1 Answer

0 votes
I think the answer should be option (c). I think an explicit explanation is not required because it can be easily checked with any 2 lower triangular matrices.
0
We will insert in matrix C in row major order or column major order?
0
As you know row major and column major representations are transpose of each other....so I suspect insertion order should be irrelevant if same convention(i.e., either row or column major) was followed for representation of A, B and C....but I would like to take other's view on this as well.
0
C is the answer

Related questions

3 votes
2 answers
1
616 views
#include <stdio.h> int main() { int *p = (int *)20; int *q = (int *)30; printf("%d", q - p); } Explain which one of the following is correct? Compilation error. 10 2 None of there.
asked Jul 14, 2017 in Programming Aghori 616 views
1 vote
1 answer
2
313 views
1.Class of grammar that will parse using LR method is proper subset of class of grammar that will parse with predictive parser . 2. LR Parser can be constructed to recognize virtually all programming language constructs for which CFG can be written . Please give valid justification for each point even if it is false
asked Apr 30, 2018 in Compiler Design radha gogia 313 views
0 votes
3 answers
4
294 views
a) lossy and dependency preserving b)lossless and dependency preserving c)losslsess and no dependency preserving d)lossy and not dependency preserving
asked Mar 18, 2017 in Databases neha singh 294 views
...