C Programming MCQ

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 : 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. Write your comments here: Updating your Comments.. Updating your Comments.. Report Error
	Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.

Sample Online Test

GK Test 4 Statement & Argument Numerical Reasoning Psychometric Online Test 1

UGC NET Paper 1 UGC NET Computer Science UGC NET Exam GATE Exam Aptitude Viva Questions General Knowledge Computer Questions Online Test

C Programming MCQ

Sample Online Test

Suggest an improvement