...
NTA UGC NET Dec 2023 Paper-2
January 19, 2024
Question 15143 – DSSSB TGT 2021
January 19, 2024
NTA UGC NET Dec 2023 Paper-2
January 19, 2024
Question 15143 – DSSSB TGT 2021
January 19, 2024

NTA UGC NET Dec 2023 Paper-2

Question 12
Which data structure is typically used to implement a hash table?
A
Linked list
B
Array
C
Binary Tree
D
Stack
Question 12 Explanation: 
In a hash table, an array is typically used to store the key-value pairs. The keys are hashed to index locations in the array using a hash function. This allows for efficient retrieval and storage of data, as the key can be used to directly access the corresponding value in the array. Arrays provide constant-time access to elements based on their index, making them a suitable data structure for implementing hash tables.
Correct Answer: B
Question 12 Explanation: 
In a hash table, an array is typically used to store the key-value pairs. The keys are hashed to index locations in the array using a hash function. This allows for efficient retrieval and storage of data, as the key can be used to directly access the corresponding value in the array. Arrays provide constant-time access to elements based on their index, making them a suitable data structure for implementing hash tables.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!