Select the accurate description of Adjacency matrix.
Difficulty: Medium
About this MCQ
This Medium Data Structures question asks: Select the accurate description of Adjacency matrix. The correct choice is D. A way of representing a graph using a 2D matrix where each cell indicates whether an edge exists between two vertices.. 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. A data structure that allows insertion and removal of elements from both the front and the back.
Why not A: “A data structure that allows insertion and removal of elements from both the front and the back.” does not fit this question. The answer is A way of representing a graph using a 2D matrix where each cell indicates whether an edge exists between two vertices..
- B. A self-balancing tree data structure that maintains sorted data and allows searches, insertions, and deletions in logarithmic time, commonly used in databases.
Why not B: “A self-balancing tree data structure that maintains sorted data and allows searches, insertions, and deletions in logarithmic time, commonly used in databases.” does not fit this question. The answer is A way of representing a graph using a 2D matrix where each cell indicates whether an edge exists between two vertices..
- C. An abstract data structure where each element has a priority, and elements are served according to that priority rather than arrival order.
Why not C: “An abstract data structure where each element has a priority, and elements are served according to that priority rather than arrival order.” does not fit this question. The answer is A way of representing a graph using a 2D matrix where each cell indicates whether an edge exists between two vertices..
- D. A way of representing a graph using a 2D matrix where each cell indicates whether an edge exists between two vertices. ✓
Correct answer
D. A way of representing a graph using a 2D matrix where each cell indicates whether an edge exists between two vertices.
Explanation
A way of representing a graph using a D matrix where each cell indicates whether an edge exists between two vertices option D is the accepted answer to Select the accurate description of Adjacency matrix Option A A data structure that allows insertion and removal of elements from both the front and the back does not fit this question Option B A self-balancing tree data structure that maintains sorted data and allows searches insertions and deletions in logarithmic time commonly used in databases does not fit this question Option C An abstract data structure where each element has a priority and elements are served according to that priority rather than.
Source: Data Structures Official Reference Guide
Tags: computer science, data structures, algorithms, programming
Submitted by: MCQsHub Editorial
Related MCQs
- What is Adjacency list primarily used for?
- What does B-tree refer to?
- Which concept is defined as follows: a way of representing a graph where each vertex stores a list of its neig...
- What is the name for a probabilistic data structure that uses multiple layers of linked lists to allow fast se...
- Which statement correctly explains Sparse matrix?
- Which of the following best describes Skip list?