Which of the following best names the concept in which a data structure that maps keys to values using a hash function for fast lookup?
Difficulty: Hard
About this MCQ
This Hard Data Structures question asks: Which of the following best names the concept in which a data structure that maps keys to values using a hash function for fast lookup? The correct choice is C. Hash table. 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. Doubly linked list
Why not A: “Doubly linked list” is not Hash table.
- B. Linked list
Why not B: “Linked list” is not Hash table.
- C. Hash table ✓
- D. Stack
Why not D: “Stack” is not Hash table.
Correct answer
C. Hash table
Explanation
Hash table is the term that matches “Which of the following best names the concept in which a data structure that maps keys to values using a hash function for fast lookup” (option C). Option A (Doubly linked list) is a different value from Hash table. Option B (Linked list) is a different value from Hash table. Option D (Stack) is a different value from Hash table. Keep Hash table as the Data Structures fact for this stem.
Source: Data Structures Official Reference Guide
Tags: computer science, data structures, algorithms, programming
Submitted by: MCQsHub Editorial
Related MCQs
- A tree data structure in which each node has at most two children. What is this concept called?
- The concept in which a data structure consisting of nodes (vertices) connected by edges, used to represent rel...
- Linked list is best defined as which of the following?
- Identify the correct definition of Graph.
- Identify the correct concept described as: a data structure where elements are stored in nodes, each pointing...
- What term describes the following? a tree-based structure that satisfies the heap property, often used to impl...