Question

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.

Answer 1

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.