ITPEC FE Morning October 2019 Question 7
Source exam: ITPEC FE Morning October 2019Topic: Basic Theory & Math
ITPEC FE Morning October 2019 — Question 7 of 80
Hashing — storage location is determined by a hash function applied to the key.
- •Hash function takes a key and returns an index (address) in the table
- •Average search time is O(1) — constant, not dependent on table size
- •Collisions occur when different keys produce the same hash value
- •Collision resolution methods: chaining (linked lists), open addressing (probing)
Why not others:
- (a) Collisions DO occur in hashing — that's why collision resolution exists
- (b) Binary tree search is a separate technique, not related to hashing
- (d) O(n) proportional search time describes linear search, not hashing
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.