ITPEC FE Morning October 2022 Question 9
ITPEC FE Morning October 2022 — Question 9 of 80
Hash Method in Table Search — determines storage location by applying a hash function to the key.
The hash method computes an address (index) directly from the key value using a hash function, enabling O(1) average-case lookup.
Why not others:
- (b) Hash methods do not avoid collisions — they handle them via chaining or open addressing
- (c) Binary tree search is a separate method, not related to hashing
- (d) Time proportional to table size describes linear search (O(n)), not hashing
Key rule: Hash = function(key) → address. Average search time is constant, independent of table size.
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.