Which data structure is typically used to implement a hash table?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. Array
Explanation
A hash table is an array of buckets indexed by the hash value (chaining adds linked lists at each slot).More Data Structures and Algorithms questions
- Which collision resolution technique involves maintaining a linked list of collided keys?
- Consider the following functions: f(n) = 3n√n, g(n) = 2√n log₂ n, h(n) = n!. Which of the following is true?
- 2-3-4 trees are B-trees of order 4. They are isometric to ______ trees.
- Consider the following statements about the heap sort algorithm: A. The MAX-HEAPIFY procedure, which runs in O(lg n) time, is the key to ma…
- Match List I with List IIList I List II A. Parallel FFT I. Θ(n²) B. Iterative FFT II. Θ(n) C. Evaluation of polynomial at n points by Horne…
- Let f(n) and g(n) be asymptotically positive functions. Statement I: f(n) ≥ 1 and f(n) = O(g(n)) ⇒ g(n) = Ω(f(n)). Statement II: f(n) = O(g…