We have the best collection of the Sparse Matrix MCQs and answer with FREE PDF. These Sparse Matrix MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.
Sparse Matrix MCQs
1. Which one of the following is a Special Sparse Matrix?
a) Band Matrix
b) Skew Matrix
c) Null matrix
d) Unit matrix
Answer: Band Matrix
2. In what way the Symmetry Sparse Matrix can be stored efficiently?
a) Heap
b) Binary tree
c) Hash table
d) Adjacency List
Answer: Binary tree
3. The matrix contains m rows and n columns. The matrix is called Sparse Matrix if ________
a) Total number of Zero elements > (m*n)/2
b) Total number of Zero elements = m + n
c) Total number of Zero elements = m/n
d) Total number of Zero elements = m-n
Answer: Total number of Zero elements > (m*n)/2
4. Which of the following is not the method to represent Sparse Matrix?
a) Dictionary of Keys
b) Linked List
c) Array
d) Heap
Answer: Heap
5. Which matrix has most of the elements (not all) as Zero?
a) Identity Matrix
b) Unit Matrix
c) Sparse Matrix
d) Zero Matrix
Answer: Sparse Matrix
6. What is the relation between Sparsity and Density of a matrix?
a) Sparsity = 1 – Density
b) Sparsity = 1 + Density
c) Sparsity = Density*Total number of elements
d) Sparsity = Density/Total number of elements
Answer: Sparsity = 1 – Density
7. Who coined the term Sparse Matrix?
a) Harry Markowitz
b) James Sylvester
c) Chris Messina
d) Arthur Cayley
Answer: Harry Markowitz
Also Read about Arrays Types
1000+ Data Structure MCQs
Abstract Data Types |
Application of Stacks |
Arrays Types |
Types of Lists |
Binary Trees |
B-Trees |
Trees |
Heap |
Trie |
Hash Tables |
Graph |
Download PDF (Sparse Matrix MCQs)
Categories: Arrays Types