The following statement describes a specific concept. What is it called? a way of representing a graph using a 2D matrix where each cell indicates whether an edge exists between two vertices.
Difficulty: Medium
About this MCQ
This Medium Data Structures MCQ checks one syllabus fact.
The question is: “The following statement describes a specific concept. What is it called? a way of representing a graph using a 2D matrix where each cell indicates whether an edge exists between two vertices.”
The accepted answer is C. Adjacency matrix. The following statement describes a specific concept What is it called a way of representing a graph using a D matrix where each cell indicates whether an edge exists between two vertices is answered by Adjacency matrix option C Option A Hash collision does not match the stem it is a near-miss used to catch incomplete recall of Adjacency matrix Option B Skip list does not match the stem it is a near-miss used to catch incomplete recall of Adjacency matrix Remaining alternatives Linear probing fall outside the same rule and should be eliminated once Adjacency matrix is identified Data Structures questions of this type reward precise definitions rather than approximate associations Data Structures recall of this distinction is a.
- A. Hash collision
Why not A: “Hash collision” is not correct. The accepted answer is C. Adjacency matrix. The following statement describes a specific concept What is it called a way of representing a graph using a D matrix where each cell indicates whether an edge exists between two v
- B. Skip list
Why not B: “Skip list” is not correct. The accepted answer is C. Adjacency matrix. The following statement describes a specific concept What is it called a way of representing a graph using a D matrix where each cell indicates whether an edge exists between two v
- C. Adjacency matrix ✓
- D. Linear probing
Why not D: “Linear probing” is not correct. The accepted answer is C. Adjacency matrix. The following statement describes a specific concept What is it called a way of representing a graph using a D matrix where each cell indicates whether an edge exists between two v
Correct answer
C. Adjacency matrix
Explanation
The following statement describes a specific concept What is it called a way of representing a graph using a D matrix where each cell indicates whether an edge exists between two vertices is answered by Adjacency matrix option C Option A Hash collision does not match the stem it is a near-miss used to catch incomplete recall of Adjacency matrix Option B Skip list does not match the stem it is a near-miss used to catch incomplete recall of Adjacency matrix Remaining alternatives Linear probing fall outside the same rule and should be eliminated once Adjacency matrix is identified Data Structures questions of this type reward precise definitions rather than approximate associations Data Structures recall of this distinction is a.
Source: Data Structures Official Reference Guide
Tags: computer science, data structures, algorithms, programming
Submitted by: MCQsHub Editorial
Related MCQs
- Which concept is defined as follows: a way of representing a graph where each vertex stores a list of its neig...
- Which term refers to a self-balancing tree data structure that maintains sorted data and allows searches, inse...
- Which statement correctly explains Sparse matrix?
- What does B-tree refer to?
- Select the correct name for: a matrix in which most of the elements are zero, often stored using specialized s...
- What is the name for a probabilistic data structure that uses multiple layers of linked lists to allow fast se...