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 question asks: A situation in a hash table where two different keys produce the same hash value. What is this concept called? The correct choice is B. Hash collision. 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. Sparse matrix
Why not A: “Sparse matrix” does not fit this question. The answer is Hash collision.
- B. Hash collision ✓
- C. Skip list
Why not C: “Skip list” does not fit this question. The answer is Hash collision.
- D. Adjacency matrix
Why not D: “Adjacency matrix” does not fit this question. The answer is Hash collision.
Correct answer
B. Hash collision
Explanation
Hash collision (option B) is the accepted answer to “A situation in a hash table where two different keys produce the same hash value. What is this concept called”. Option A (Sparse matrix) does not fit this question. Option C (Skip list) does not fit this question. Option D (Adjacency matrix) does not fit this question. For this Data Structures question, the accepted answer is Hash collision.
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...