ITPEC FE Morning April 2022 Question 29
ITPEC FE Morning April 2022 — Question 29 of 80
Hash Index Collision — different keys can hash to the same storage location.
A hash index calculates a storage address from a key value using a hash function. Because the output space is finite, different keys can produce the same hash value — this is called a collision.
Why not others:
- (a) B+ tree index — stores keys in a sorted tree structure; each key maps to a unique pointer
- (b) Bitmap index — uses bit arrays per column value; no address calculation from key
- (d) Inverted index — maps terms to document lists (used in search engines); not address-based
Key rule: If a question mentions "calculating storage location from a key" + "same result from different keys" → it's describing a hash collision.
AI-generated — may contain errors
The original exam layout is preserved in the image so diagrams, formulas, tables, and code remain accurate.
This question comes from an official ITPEC past paper. ITPEC Practice is an independent study tool and is not affiliated with ITPEC. See the official FE past-paper collection or Report an issue.