can anybody tell me abt sparse matrix ,rules when a matrix is sparse and when notand its implementataion.?

Answer 1

Well, I can't tell you much, but the general idea is that a sparse matrix consists mainly of elements with value 0. So it's a waste of space to store the entire matrix explicitly. Instead, we store some sort of list of the non-zero entries, and assume that entries not mentioned in the list are zero.

I don't think there's a definite point at which a matrix becomes sparse, and eligible for this special treatment. It's the classic time-space tradeoff. The link below has some more info.

Answer 2

sparse matrix ia a matrix which has high proposion of zero entries.
eg:
2 0 0 0 0 0
2 4 0 0 0 0
3 6 6 0 0 0 (30 elements)
4 3 3 7 0 0
3 3 3 4 5 0

This is useful in that case when we've to store only those entries which are non zero.
for eg:
Suppose we want to store the elements of above matrix in a linear array B. As we are only concerning nonzero elements so there is no need to put zeros in memory.So In B we'll 've only 15 elements which are nonzero.
Thus it helps in saving memory space .

Answer 3

sparse matrix is nohin but a matrix which has most of the values as zeros..

its implemantation can be done as follows:
create a list for a row head and column head.
the node should contain two poiner field 3 data fields one for row num,col num and value....when an element is inserted its row and column values are checked and the head is traversed accordingly and the element is inserted.create a circular list here
use ur own logic for addition n multiplication..it is not so tough..