Week 10 Workshop 7 Linear Data Structures – Part 3 Application - Hashing

 0    12 fiche    up804653
Télécharger mP3 Imprimer jouer consultez
 
question English réponse English
what is hashing?
commencer à apprendre
Hashing involves using an array for the efficient storage and retrieval of information
what is the idea effeicency for hashing for storage and retrival?
commencer à apprendre
O(1)
how are collisions resolved?
commencer à apprendre
Collision is resolved by finding a free location. Next location (1) is still free - use this location. Key 10 maps to position 2
what defines a " good hash function"
commencer à apprendre
A good hash function must: Quick and easy to compute Minimise collisions Achieve an even distribution of keys Aim: Efficiency O(1) for storage and retrieval of data
what is truncation?
commencer à apprendre
Ignores parts of the key and uses remaining parts as the hash value. Fast but can fail to distribute keys uniformly.
what is folding?
commencer à apprendre
Split key into several parts and then combine the parts to obtain hash value. Often gives better spread than truncation.
what is Modula Arithmetic?
commencer à apprendre
Divide key by table size - use remainder as the hash value For good spread - table size must be prime.
what is Collision Resolution with Chaining
commencer à apprendre
Uses singly linked lists to resolve the collisions.
what is Collision Resolution with Open Addressing using Linear Rehash or Linear Probing
commencer à apprendre
A linear search of the table from the hashed position is used to find an empty slot.
what is Collision Resolution with Open Addressing using Quadratic Rehash or Quadratic Probing
commencer à apprendre
The following slots are tried to find an empty slot: h + i2 (mod table size) for i = 1,2,3... ie: slots tried are: h, h+1, h+4, h+9, h+16 ...... (mod table size) Works well if the table size is prime.
what is Collision Resolution with Open Addressing using Add the hash Rehash
commencer à apprendre
The hash value is added to the hashed value repetitively to find an empty slot. ie: slots tried are: h, 2h, 3h, 4h, ... (mod table size) Works well if the table size is prime.
what is Collision Resolution with Open Addressing using random Rehash
commencer à apprendre
a pseudo‑random number generator is used to obtain the increments Uses a seed to initiate the sequence of random numbers. Excellent in avoiding collisions but slower

Vous devez vous connecter pour poster un commentaire.