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
Difference among Prism's and Kruskal's Algorithm In Kruskal's algorithm, the set A is a forest. The safe edge added to A is always a least-weight edge in the paragraph that lin

Describe an algorithm to play the Game of Nim using all of the three tools (pseudocode, flowchart, hierarchy chart)

An AVL tree is a binary search tree that has the given properties: The sub-tree of each of the node differs in height through at most one. Each sub tree will be an AVL tre

Do you have a library solution for this problem?

: Write an algorithm to evaluate a postfix expression. Execute your algorithm using the following postfix expression as your input: a b + c d +*f ­ .

Q. What do you understand by the term by hash clash? Explain in detail any one method to resolve the hash collisions.

Merging two sequence using CREW merge

Explain Floyd's algorithm It is convenient to record the lengths of shortest paths in an n by n matrix D known as the  distance matrix: the element d ij   in the i th   row an

Ans: I nsertion into the B-tree: 1.  First search is made for the place where the new record must be positioned. As soon as the keys are inserted, they are sorted into th

for (i = 0; i sequence of statements } Here, the loop executes n times. Thus, the sequence of statements also executes n times. Since we suppose the time complexity of th