Q. Make the 11 item hash table resulting from hashing the given keys: 12, 44, 13, 88, 23, 94, 11, 39, 20, 16 and 5 by making use of the hash function h(i) = (2i+5) mod 11.     

Ans.

The size of the table is  11

h(12) = (24+5) mod 11 = 29 mod 11 = 7

h(44) = (88+5) mod 11 = 93 mod 11 = 5

h(13) = (26+5) mod 11 = 31 mod 11 = 9

h(88) = (176+5)mod 11= 181mod 11 = 5

h(23) = (46+5) mod 11 = 51 mod 11 = 7

h(94) = (188+5)mod 11= 193mod 11 = 6

h(11) = (22+5) mod 11 = 27 mod 11 = 5

h(39) = (78+5) mod 11 = 83 mod 11 = 6

h(20) = (40+5) mod 11 = 45 mod 11 = 1

h(16) = (24+5) mod 11 = 29 mod 11 = 4

h(5) = (10+5) mod 11 = 15 mod 11 = 4

Posted Date: 7/12/2012 8:37:30 AM | Location : United States

Ask an Expert

Related Discussions:- Hash table, Assignment Help, Ask Question on Hash table, Get Answer, Expert's Help, Hash table Discussions

Write discussion on Hash table
Your posts are moderated

Write your message here..

Related Questions

Create a binary tree , Create a class "box" that will contain a random inte... Create a class "box" that will contain a random integer value v such that O

Algorithm, implement multiple stacks in a single dimensional array. write a... implement multiple stacks in a single dimensional array. write algorithm for various stack operation for them

Boundary tag system., boundary tag system in data structure? boundary tag system in data structure?

Two sparce matrices multipilcation algorithm, Write an algorithm for multi... Write an algorithm for multiplication of two sparse matrices using Linked Lists.

2 way merge sort, merge sort process for an example array {38, 27, 43, 3, 9... merge sort process for an example array {38, 27, 43, 3, 9, 82, 10}. If we take a closer look at the diagram, we can see that the array is recursively divided in two halves till the

Two broad classes of collision resolution techniques, Two broad classes of ... Two broad classes of collision resolution techniques are A) open addressing and B) chaining

State about the pre- and post conditions, State about the pre- and post con... State about the pre- and post conditions Programmers can easily document other pre- and post conditions and class invariants, though, and insert code to check most value preco

Acyclic graph, Tree is a widely used data structure employed for representi... Tree is a widely used data structure employed for representing several problems. We studied tree like a special case of acyclic graph. Though, rooted trees are most prominent of al

Creation of Heap, Q. Create a heap with the given list of keys: ... Q. Create a heap with the given list of keys: 8, 20, 9, 4, 15, 10, 7, 22, 3, 12                                                  Ans: Creation

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