Question

Python: Write a program that inserts numbers from a file into a linear probing hash table and records the amount of collisions that occur after each insertion.

Hash Table size is 191, so 100 random numbers are to be inserted to the table to collect number of collisions.

Answer 1

#opening and reading data from file, which are in string format 2 with open('expr.txt) as f: lines f.read).splitlines0 keys (#keys will store numbers in the file in int format 4 5 무for line in lines: keys.append(intline)) #changing string to int and storing in keys[] list # HashTable 8 HashTable - dict0) size-191#hash table size 10 무 for i in range (0,size):#initially store-1 as value for every key in the hashtable 11 L HashTable[i]1; 12 collisions-(#to record collisions 13 #for every key in the keys 14 for key in keys 15 16 17 18 19 20 21 temp - key collision = 0#initially collision is zero #until we place key in hash table while(True) #if there is no value in the key if HashTable [temp % size] -1: collisions.append(collision) #store collision number for that key HashTable [temp % size-key#store that value break 23 24 25 26 27 28 #displaying collisions record 29 print #if collision occurs else: collision-: collision 1#increment collision number temp ( temp % size ) + collision #linear probing "Collisions reacord:" print collisions

#opening and reading data from file, which are in string format
with open("expr.txt") as f:
   lines = f.read().splitlines()
keys = []#keys will store numbers in the file in int format
for line in lines:
   keys.append(int(line))#changing string to int and storing in keys[] list
#HashTable
HashTable = dict()
size = 191#hash table size
for i in range(0,size):#initially store -1 as value for every key in the hashtable
   HashTable[i] = -1;
collisions = []#to record collisions
#for every key in the keys
for key in keys:
   temp = key
   collision = 0#initially collision is zero
   #until we place key in hash table
   while(True):
       #if there is no value in the key
       if HashTable[temp % size] == -1:
           collisions.append(collision)#store collision number for that key
           HashTable[temp % size] = key#store that value
           break
       #if collision occurs
       else:
           collision = collision + 1#increment collision number
           temp = ( temp % size ) + collision #Linear probing
#displaying collisions record
print "Collisions reacord:"
print collisions