CPArrys Q12

0. In which of the following cases, linked list implementation of sparse matrices consumes the same memory space as the conventional way of storing the entire array?

  • Option : C
  • Explanation :
    Conventional way needs storage of m x n
    In the case of linked list implementation of sparse matrices, storage needed will be(the number of non-zero entries).
    Only in case(c), both the methods need the same storage of 30.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *