Chaining Method as Method of Collision Resolution , Data Structure & Algorithms

Q. The given values are to be stored in a hash table

25, 42, 96, 101, 102, 162, 197

Explain how the values are hashed by using division technique of hashing with a table size of 7. Use chaining as the method of collision resolution.                 

Ans:

Table size=7

25%7=4

42%7=0

96%7=5

101%7=3

102%7=4

162%7=1

197%7=1

So collision resolution can be resolved as shown below:

856_Collision Resolution.png

Posted Date: 7/10/2012 5:51:32 AM | Location : United States







Related Discussions:- Chaining Method as Method of Collision Resolution , Assignment Help, Ask Question on Chaining Method as Method of Collision Resolution , Get Answer, Expert's Help, Chaining Method as Method of Collision Resolution Discussions

Write discussion on Chaining Method as Method of Collision Resolution
Your posts are moderated
Related Questions
Technique for direct search is    Hashing is the used for direct search.

Which sorting algorithm is easily adaptable to singly linked lists? Simple Insertion sor t is easily adabtable to singly linked list.

QUESTION (a) Define a tree and list its properties. (b) By showing all your workings, draw the spanning tree for the following graph based on the Breadth-First-Search algori

Varieties of Arrays In some languages, size of an array should be established once and for all at program design time and can't change during execution. Such arrays are known a

Q. How do we represent a max-heap sequentially? Explain by taking a valid   example.         Ans: A max heap is also called as a descending heap, of size n is an almos

The number of different directed trees with 3 nodes are ?? The number of disimilar directed trees with three nodes are 3

HEAP  A heap is described to be a binary tree with a key in every node, such that  1-All the leaves of the tree are on 2 adjacent levels. 2- All leaves on the lowest leve

In the last subsection, we have implemented a stack by using an array. While a stack is implemented by using arrays, it suffers from the basic restriction of an array - i.e., its s

Q. An, array, A comprises of n unique integers from the range x to y(x and y inclusive where n=y-x). Which means, there is only one member that is not in A. Design an O(n) time alg

Loops There are 3 common ways of performing a looping function: for ... to ... next, while ... endwhile and repeat ... until The below example input 100 numbers and find