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

Traversing a graph, two standards ways of traversing a graph in data struc... two standards ways of traversing a graph in data structure

ERM, Hi, can you give me a quote for an E-R diagram Hi, can you give me a quote for an E-R diagram

Data structures, #quCreate a flowchart to show the process that will allow ... #quCreate a flowchart to show the process that will allow the implementation of Queue, Enqueue, and Dequeue operations.estion..

Merge sort, #question. merging 4 sorted files containing 50,10,25,15 record... #question. merging 4 sorted files containing 50,10,25,15 records will take time?

Multiple queue, How to create multiple queue on single array? How to create multiple queue on single array?

Brute force, Determine the number of character comparisons made by the brut... Determine the number of character comparisons made by the brute-force algorithm in searching for the pattern GANDHI in the text

Explain the linked list implementation of stack, Question 1 Explain the fo... Question 1 Explain the following? Arrays Stack Trees Question 2 Explain the Linked list implementation of stack Question 3 What is a binary tree? Expla

Size of stack, The size of stack was declared as ten. Thus, stack cannot ho... The size of stack was declared as ten. Thus, stack cannot hold more than ten elements. The major operations which can be performed onto a stack are push and pop. However, in a prog

Array implementation of a queue, Since the stack is list of elements, the q... Since the stack is list of elements, the queue is also a list of elements. The stack & the queue differ just in the position where the elements may be added or deleted. Similar to

What is efficiency of algorithm, What is Efficiency of algorithm? Effic... What is Efficiency of algorithm? Efficiency of an algorithm can be precisely explained and investigated with mathematical rigor.  There are two types of algorithm efficiency