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?

Question

TuteeHUB · Accepted Answer

Efficient if the sparse matrix is a band matrix

TuteeHUB · Answer

5x6 matrix with 9 non-zero entries

TuteeHUB · Answer

5x6 matrix with 10 non-zero entries

TuteeHUB · Answer

Efficient in accesing an entry

1.	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?
A.	5x6 matrix with 9 non-zero entries
B.	5x6 matrix with 10 non-zero entries
C.	Efficient in accesing an entry
D.	Efficient if the sparse matrix is a band matrix
Answer» D. Efficient if the sparse matrix is a band matrix

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?

Discussion

No Comment Found

Related MCQs

Reply to Comment