+1 vote
in Data Structures & Algorithms I by (110k points)
Which of the following is an advantage of matrices?

(a) Internal complexity

(b) Searching through a matrix is complex

(c) Not space efficient

(d) Graph Plotting

Asked question is from Matrix topic in section Arrays Types of Data Structures & Algorithms I

This question was addressed to me in final exam.

1 Answer

+1 vote
by (408k points)
selected by
Best answer
Right option is (d) Graph Plotting

To explain: Adjacency and Incidence Matrices are used to store vertices and edges of a graph. It is an advantage to plot graphs easily using matrices. But Time complexity of a matrix is O(n^2) and sometimes the internal organization becomes tedious. They are all disadvantages of matrices.

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.