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

When writing a code for a program that basically answers Relative Velocity questions how do you go at it? How many conditions should you go through?

Spanning Trees: A spanning tree of a graph, G, refer to a set of |V|-1 edges which connect all vertices of the graph. There are different representations of a graph. They are f

A queue is a particular type of collection or abstract data type in which the entities in the collection are went in order and the principal functions on the collection are the add

Your program should include three components selling, buying and managing for the use of sellers, buyers and the Manager, respectively. Provide a menu for a user to enter each comp

Explain the Scan-Line Algorithm This image-space method for removing hidden surfaces is an extension of the scan-line algorithm for filling polygon interiors. Instead of fillin

Explain an efficient way of storing a sparse matrix in memory.   A matrix in which number of zero entries are much higher than the number of non zero entries is called sparse mat

Program: Creation of Doubly Linked List OUTPUT Input the values of the element -1111 to come out : 1 Input the values of the element -1111 to come out : 2 Inpu

Write an algorithm in the form of a flowchart that: inputs top speeds (in km/hr.) of 5000 cars Outputs fastest speed and the slowest speed Outputs average (mean) s

differences between direct and indirect recursion