+1 vote
in Data Structures & Algorithms I by (110k points)
In what way the Symmetry Sparse Matrix can be stored efficiently?

(a) Heap

(b) Binary tree

(c) Hash table

(d) Adjacency List

The above asked question is from Arrays Types topic in chapter Arrays Types of Data Structures & Algorithms I

The question was posed to me in an interview for job.

1 Answer

+1 vote
by (408k points)
selected by
Best answer
Right option is (b) Binary tree

Best explanation: Since Symmetry Sparse Matrix arises as the adjacency matrix of the undirected graph. Hence it can be stored efficiently as an adjacency list.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.