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?

Answer
Comment
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.

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.