- Home
- Interview Questions
- Data structures and Algorithms
Hash function is a well-defined procedure or mathematical function that takes a variable-size input m and returns a fixed-size string, usually this is called hash value, hash code, hash sum or checksum.
- avoids collisions
- tends to spread keys evenly in the array
- is easy to compute
chained scatter table is a scatter table whose elements are ordered pairs. Each array element contains a key and a pointer. All the keys are stored in the table itself. Consequently, there is a fixed limit on the number of items that can be stored in a scatter table.
No. To lock a view, take lock on the underlying tables.
Open addressing is a method of collision resolution in hash tables. With this method the collision is resolved by searching through different locations in the array (the probe sequence) until either the target record is found, or an unused array slot is found, which indicates that there is no such key in the table.
|
|
||||||||||||||||||||||||||||
