A situation in a hash table where two different keys produce the same hash value. What is this concept called?
Difficulty: Medium
About this MCQ
This Medium Data Structures MCQ checks one syllabus fact.
The question is: “A situation in a hash table where two different keys produce the same hash value. What is this concept called?”
The accepted answer is B. Hash collision. “A situation in a hash table where two different keys produce the same hash value. What is this concept called” is answered by Hash collision (option B). Option A (“Sparse matrix”) does not match the stem; it is a near-miss used to catch incomplete recall of Hash collision. Option C (“Skip list”) does not match the stem; it is a near-miss used to catch incomplete recall of Hash collision. Remaining alternatives (Adjacency matrix) fall outside the same rule and should be eliminated once Hash collision is identified. Data Structures questions of this type reward precise definitions rather than approximate associations. Data Structures recall of this distinction is a regular item in FPSC, PPSC, NTS, and CSS papers.
- A. Sparse matrix
Why not A: “Sparse matrix” is not correct. The accepted answer is B. Hash collision. “A situation in a hash table where two different keys produce the same hash value. What is this concept called” is answered by Hash collision (option B). Option A (“Sparse matrix”)
- B. Hash collision ✓
- C. Skip list
Why not C: “Skip list” is not correct. The accepted answer is B. Hash collision. “A situation in a hash table where two different keys produce the same hash value. What is this concept called” is answered by Hash collision (option B). Option A (“Sparse matrix”)
- D. Adjacency matrix
Why not D: “Adjacency matrix” is not correct. The accepted answer is B. Hash collision. “A situation in a hash table where two different keys produce the same hash value. What is this concept called” is answered by Hash collision (option B). Option A (“Sparse matrix”)
Correct answer
B. Hash collision
Explanation
“A situation in a hash table where two different keys produce the same hash value. What is this concept called” is answered by Hash collision (option B). Option A (“Sparse matrix”) does not match the stem; it is a near-miss used to catch incomplete recall of Hash collision. Option C (“Skip list”) does not match the stem; it is a near-miss used to catch incomplete recall of Hash collision. Remaining alternatives (Adjacency matrix) fall outside the same rule and should be eliminated once Hash collision is identified. Data Structures questions of this type reward precise definitions rather than approximate associations. Data Structures recall of this distinction is a regular item in FPSC, PPSC, NTS, and CSS papers.
Source: Data Structures Official Reference Guide
Tags: computer science, data structures, algorithms, programming
Submitted by: MCQsHub Editorial
Related MCQs
- Identify the correct concept described as: a measure in a hash table calculated as the number of stored elemen...
- Which of the following best names the concept in which a collision resolution technique in hashing that search...
- Which of the following best describes Skip list?
- What is the function or purpose of Linear probing?
- What is the name for a probabilistic data structure that uses multiple layers of linked lists to allow fast se...
- The concept in which a method of visiting all nodes of a tree by processing the left subtree, then the node, t...