1
GATE CSE 2004
+2
-0.6
Two matrices M1 and M2 are to be stored in arrays A and B respectively. Each array can be stored either in row-major or column-major order in contiguous memory locations. The time complexity of an algorithm to compute M1$$\times$$ M2 will be
A
Best if A is in row-major and B is in column-major order
B
Best if both are in row-major order
C
Best if both are in column-major order
D
Independent of the storage scheme
2
GATE CSE 1998
+2
-0.6
Let A be a two dimensional array declared as follows:
A : array [ 1... 10] [1... 15] of integer;
Assuming that each integer takes one memory locations the array is stored in row-major order and the first element of the array is stored at location 100, what is the address of the element A[i] [j]?
A
15i + j + 84
B
15j + i + 84
C
10i + j + 89
D
10j + i + 89
3
GATE CSE 1994
+2
-0.6
In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size n $$\times$$ n, non-zero elements (i.e., elements of the lower triangle) of each row are stored one after another, starting from the first row, the index of the (i, j)th element of the lower triangular matrix in this new representation is
A
i + j
B
i + j - 1
C
$$(j - 1) + i{{(i - 1)} \over 2}$$
D
$$i + {{j(j - 1)} \over 2}$$
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization
EXAM MAP
Joint Entrance Examination