ITPEC FE Subject A April 2024 Question 15
ITPEC FE Subject A April 2024 — Question 15 of 60
Hashing for Data Search — hash function converts data into storage addresses for fast O(1) lookup.
What is hashing:
- A hash function takes input data and computes a fixed-size value (hash)
- That hash value is used as the storage address (index in a hash table)
- Lookup is direct: compute hash → go to address → get data
- Fast and highly scalable
Why not others:
- (a) — describes AI-based semantic search (intent recognition, decision functions)
- (c) — describes data mining (finding trends, correlations, patterns in large datasets)
- (d) — describes a thesaurus/synonym dictionary for improving keyword search hit ratio
Key rule: Hashing = data → hash function → address. O(1) average lookup time.
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.