1

GATE CSE 2004

MCQ (Single Correct Answer)

+2

-0.6

Two matrices M

_{1}and M_{2}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 M_{1}$$\times$$ M_{2}will be2

GATE CSE 1998

MCQ (Single Correct Answer)

+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 : 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]?

3

GATE CSE 1994

MCQ (Single Correct Answer)

+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 isQuestions Asked from Arrays (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages