Two matrices M1 and M2 are to be stored in arrays A and B respectively. Each…

PYQ GATE 2004

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 × M2 will be

  1. A.

    best if A is in row-major, and B is in column- major order

  2. B.

    best if both are in row-major order

  3. C.

    best if both are in column-major order

  4. D.

    independent of the storage scheme

Attempted by 511 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…