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
Range: A Structured Type in Ruby Ruby has a numerous structured types, comprising arrays, hashes, sets, classes, streams, and ranges. In this section we would only discuss rang

write an algorithm and draw a flowchart to calculate the perimeter and area of a circle

Q. What is the need of using asymptotic notation in the study of algorithm? Describe the commonly used asymptotic notations and also give their significance.

How to create an General Tree and how to search general tree?

Program for Linear Search. Program: Linear Search /*Program for Linear Search*/ /*Header Files*/ #include #include /*Global Variables*/ int search; int

Write an algorithm for multiplication of two sparse matrices using Linked Lists.

A company is carrying out a survey by observing traffic at a road junction. Every time a car, bus or lorry passed by road junction it was noted down. 10 000 vehicles were counted d

Thus far, we have seen the demonstration of a single queue, but several practical applications in computer science needs several queues. Multi queue is data structure in which mult

Q. What do you mean by the best case complexity of quick sort and outline why it is so. How would its worst case behaviour arise?

The simplest implementation of the Dijkstra's algorithm stores vertices of set Q into an ordinary linked list or array, and operation Extract-Min(Q) is just a linear search through