Q. Explain the Hash Tables, Hash function and Hashing Techniques properly?            

Ans.

Hash Table is explained as follows:

A hash table is a data structure in which the location or address of a data item is determined straight as a function of data item itself rather than by a series of comparison. Under ideal condition, the time required to locate a data item in a hash table is 0(1) ie. It is stable and DOES not rely on the number of data items saved. When the set of K of keys stored is much less than the universe U of all possible keys, a hash table need much less storage spare than a direct address table.

Hash Functions are explained below

A hash function h is simply a mathematical formula which manipulates the key in some form to finish the index for this key in the hash table. Eg a hash function can split the key by some number, generally the size of the hash table and return remainder as the index for the key. Usually, we say that a hash function h maps the universe U of keys into the slots of a hash table T[0....n-1]. This course  of  mapping  keys  to  appropriate slots  in  a  hash  table  is  termed  as hashing.

The major reconsideration for selecting hash function is :-

1)     It should be probable to compute it efficiently.

2)      It should distribute the keys uniformly across the hash table i.e. it should keep the number of collisions as small as possible.

Hashing Techniques are explained below:

There are number of hashing techniques. Some of them are given below:-

a) Division Method can be defined as:- In this method or technique, key K to be mapped into one of the m states in the hash table is spitted by m and the remainder of this spitted taken as index into the hash table. That is the hash function is

h(k) = k mod m

in which mod is the modules operation.

b)      Multiplication Method can be defined as: The multiplication method or techniques operates in 2 steps. In the 1st step the key value K is multiplied by a constant A in the range O

h(k) = [m (K A mod 1)]

where "K A mod 1" means the fractional part KA of KA-[KA].A A= (5-1/2)=0.6180334887

(c) Midsquare Method can be defined as:- this may operate in 2 steps. In the first step the square of the key value K is taken. In the 2nd step, the hash value is obtained by deleting digits from ends of the squared values ie. K2. The hash function is

h(k) = s

where s is obtained by deleting digits from both sides of K2.

Posted Date: 7/13/2012 1:22:28 AM | Location : United States

Ask an Expert

Related Discussions:- Hash tables, hash function and hashing techniques, Assignment Help, Ask Question on Hash tables, hash function and hashing techniques, Get Answer, Expert's Help, Hash tables, hash function and hashing techniques Discussions

Write discussion on Hash tables, hash function and hashing techniques
Your posts are moderated

Write your message here..

Related Questions

#titlestrings, given the string "Data Structures & , Algorithms", write a p... given the string "Data Structures & , Algorithms", write a program that uses sequential search to return index of ''&''

Boundary tag method in context of dynamic memory management, Q. How can we ... Q. How can we free the memory by using Boundary tag method in the context of Dynamic memory management?

Standard ways of traversing a graph, Q. Which are the two standard ways of ... Q. Which are the two standard ways of traversing a graph?  Explain them with an example of each.  Ans:   T he two ways of traversing a graph are written below

Circular queue, explain implementation of circular queue insert,delete oper... explain implementation of circular queue insert,delete operations

Methods of collision resolution, Methods of Collision Resolution 1)  Co... Methods of Collision Resolution 1)  Collision Resolution by separate chaining  2)  Collision Resolution by open addressing

Travelling salesman problem, Example 3: Travelling Salesman problem G... Example 3: Travelling Salesman problem Given: n associated cities and distances among them Find: tour of minimum length that visits all of city. Solutions: How several

Efficiency of binary search, Each of the comparison in the binary search de... Each of the comparison in the binary search decrease the number of possible candidates where the key value can be searched by a factor of 2 as the array is divided into two halves

Non-recursive implementation of binary tree traversals, As we have seen, as... As we have seen, as the traversal mechanisms were intrinsically recursive, the implementation was also easy through a recursive procedure. Though, in the case of a non-recursive me

Algorithm for pre-order traversal, Hear is given a set of input representin... Hear is given a set of input representing the nodes of a binary tree, write a non recursive algorithm that must be able to give the output in three traversal orders. Write down an

State about the simple types - built-in types, State about the Simple types... State about the Simple types - Built-In Types Values of the carrier set are atomic, that is, they can't be divided into parts. Common illustrations of simple types are inte