Select the correct name for: a matrix in which most of the elements are zero, often stored using specialized structures to save memory.
Difficulty: Hard
About this MCQ
This Hard Data Structures question asks: Select the correct name for: a matrix in which most of the elements are zero, often stored using specialized structures to save memory. The correct choice is B. Sparse matrix. Read the options below, commit to one, then use the explanation to see why that choice holds and why the others do not.
Data Structures items like this one are written for Pakistan exams such as CSS, FPSC, PPSC, and NTS. The difficulty label is a hint about how much of the topic the stem assumes, not a score. Tags and exam names, when they are present, tell you where else the same idea is tested. Previous and next links stay in Data Structures so you can continue the subject. Related questions point at nearby stems if you want another angle on the same idea.
Treat the explanation as part of the question, not a footnote. If you missed it, reread the stem against the correct option before you open the next Data Structures item. A timed quiz is the same pool with a clock and a score. A past paper is a full sitting rather than this single question.
- A. Adjacency matrix
Why not A: “Adjacency matrix” does not fit this question. The answer is Sparse matrix.
- B. Sparse matrix ✓
- C. Linear probing
Why not C: “Linear probing” does not fit this question. The answer is Sparse matrix.
- D. Load factor
Why not D: “Load factor” does not fit this question. The answer is Sparse matrix.
Correct answer
B. Sparse matrix
Explanation
Sparse matrix (option B) is the accepted answer to “Select the correct name for: a matrix in which most of the elements are zero, often stored using specialized structures to save memory.”. Option A (Adjacency matrix) does not fit this question. Option C (Linear probing) does not fit this question. Option D (Load factor) does not fit this question. For this Data Structures question, the accepted answer is Sparse matrix.
Source: Data Structures Official Reference Guide
Tags: computer science, data structures, algorithms, programming
Submitted by: MCQsHub Editorial
Related MCQs
- What term describes the following? a data structure that allows insertion and removal of elements from both th...
- Which concept is defined as follows: a way of representing a graph where each vertex stores a list of its neig...
- Identify the correct definition of Priority queue.
- What is Adjacency list primarily used for?
- The concept in which an abstract data structure where each element has a priority, and elements are served acc...
- The following statement describes a specific concept. What is it called? a way of representing a graph using a...