Q:

The time complexity of an algorithm to compute M1 × M2 will be

0

The time complexity of an algorithm to compute M1 × M2 will be

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.


  1. best if A is in row-major, and B is in column- major order
  2. best if both are in row-major order
  3. best if both are in column-major order
  4. independent of the storage scheme

All Answers

need an explanation for this answer? contact us directly to get an explanation for this answer

Correct Answer:

independent of the storage scheme

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

ADA Algorithm MCQ Quiz (Multiple Choice Questions And Answers)

This question belongs to these collections

Similar questions


need a help?


find thousands of online teachers now
Randomized quicksort is an extension of quicksort ... >>
<< The minimum number of comparisons required to find...