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
Example of Area Subdivision Method The procedure will be explained with respect to an illustrative problem, with the image consisting of five objects, namely a triangle (T), qu


Algorithm for Z-Buffer Method (a)  Initialize every pixel in the viewport to the smallest value of z, namely z0 the z-value of the rear clipping plane or "back-ground". Store a

Mid Square method with good example

Now, consider a function that calculates partial sum of an integer n. int psum(int n) { int i, partial_sum; partial_sum = 0;                                           /* L


Q. Write  down the  algorithm  to  insert  an  element  to  a  max-heap  which  is  represented sequentially.           Ans: The algorithm to insert an element "newkey" to

WHAT IS THE PURPOSE OF STACK IN C

In any singly linked list, each of the elements contains a pointer to the next element. We have illustrated this before. In single linked list, traversing is probable only in one d

How sparse matrix stored in the memory of a computer?