Data Structures :: Matrices

Home > Technical Aptitude > Data Structures > Matrices > General Questions

NA
SHSTTON
11
Solv. Corr.
11
Solv. In. Corr.
22
Attempted
0 M:0 S
Avg. Time

1 / 2

The complexity of multiplying two matrices of order m*n and n*p is


Amnp

Bmp

Cmn

Dnp

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
11
Solv. Corr.
15
Solv. In. Corr.
26
Attempted
0 M:0 S
Avg. Time

2 / 2

If the address of A[1][1] and A[2][1] are 1000 and 1010 respectively and each element occupies 2 bytes then the array has been stored in _________ order.


Arow major

Bcolumn major

Cmatix major

DNone of these

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace