Division-remainder hashing, Data Structure & Algorithms

Assignment Help:

According to this, key value is divided by any fitting number, generally a prime number, and the division of remainder is utilized as the address for the record.

The choice of suitable divisor may not be so simple. If it is known that the file is to have n records, then we has to, assuming that only one record can be stored at a given address, have divisor n.

Also we might have a very large key space as compared to the address space. Key space refers to every possible key value. The address space possibly may not match in fact for the key values in the file. So, calculated address may not be unique. It is called Collision, that means

R(K1) = R(K2), where K1 = K2.

Two unequal keys have been calculated to have the simialr address. The keys are called as synonyms.

There are several approaches to handle the problem of collisions. One of these is to hash to buckets. A bucket is a space that can suggest multiple records.


Related Discussions:- Division-remainder hashing

What is class invariants assertion, What is Class invariants assertion ...

What is Class invariants assertion A class invariant is an assertion which should be true of any class instance before and after calls of its exported operations. Generally

Whether a binary tree is a binary search tree or not, Write an algorithm to...

Write an algorithm to test whether a Binary Tree is a Binary Search Tree. The algorithm to test whether a Binary tree is as Binary Search tree is as follows: bstree(*tree) {

Trees, Have you ever thought about the handling of our files in operating s...

Have you ever thought about the handling of our files in operating system? Why do we contain a hierarchical file system? How do files saved & deleted under hierarchical directories

Algorithm for stack using array, write an algorithm for stack using array p...

write an algorithm for stack using array performing the operations as insertion ,deletion , display,isempty,isfull.

Define a sparse metrics, Define a sparse metrics. A matrix in which num...

Define a sparse metrics. A matrix in which number of zero entries are much higher than the number of non zero entries is known as sparse matrix. The natural method of showing m

Hashing, explain collision resloving techniques in hasing

explain collision resloving techniques in hasing

Technique for direct search, Technique for direct search is    Hashing ...

Technique for direct search is    Hashing is the used for direct search.

Values are automatically assigned to those array elements, What values a...

What values are automatically assigned to those array elements which are not explicitly initialized? Garbage values are automatically assigned to those array elements that

Programs, Develop a program that accepts the car registration( hint: LEA 43...

Develop a program that accepts the car registration( hint: LEA 43242010)

Prims algorithm, how to implement prims algorithm dynamically

how to implement prims algorithm dynamically

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd