Question

4 Let the set of all possible keys considered is the set of all integers from 0 to 10,000 inclusive. Consider a closed hashing and a hash table of size M 10 and the hash function h(x) xmod 10. Note: Using a prime number as the size of the table is not a good idea. However, we do so to keep the calculations simple. a) Write an algorithm (using any programming language) to find the largest value in this hash table? Assume your algorithm gets as arguments: reference/pointer of the hash table and M (size of the hash table) (3 Marks) b) Calculate the run-time and space complexity of your algorithm in terms of big theta O. Specify the best (1155 Marks) and worst cases.

Answer 1

Ans Gven data, call poffbla He Set of Ke ys Congf dona d the futegerg t to 10,000 of relugve clek d hesing Congg das hag table and Cl CI funchon hlx)-x mod lo Stre haigh We M 10 cnd (a) alporihn (String ars) Public &tatte vofd main Map elject, Ocuble smaps= neo Hagh Map olject, Oouble maps-put "s", oouble (50,0) neus Double (o,o)); maps put ("u neu maps put (2" new Pouble (20,0)) neuble (loo.0) maps put ( t neus ooubte (30,0)) mops put 3", ooulde (0,0)) maps put (s ", new Cs Scanned with CamScanner

Double Double MiN- VALUE max Por (oljet key maps key set ) Doulle mo trpmops.getray); Pf (tmp. Lempare To (max)> ) max tmp System out patin (max) (b) he 91un-time &pace Camplexity of ou an d algonthn big thateu (o). tenms lagt the md wotst 1 he gfven hogh table he Speuce Csmplex?ty te P big theta (n) and Ps also biy theta (n) CS Scanned with CamScanner