Computing hashing question. Urgent

[RatJumper]

Guys my exam is tomorrow and i only just realised i didnt learn about hashing and have no idea on how to answer this question:

May/June 2007 Q12 (b)

Any help would be greatly appreciated.

Thankx

 

[akii]

the question says about 6 digit ok... so we take 123456 as it 6 digits
how to get clashes when using hashing algorithm in this.
123456 will have the same address that is 3456 as
213456.
Just change the first 2 digits and its clashes dude.
Good luck dude work well because it sure dry run an algorithm and hashing algorithm and revise june 2007 well

 

[RatJumper]

thankx for that dude.. but isnt what you just told me for part (ii) of the question? how would i do part (i)?

 

[akii]

as stated by the question 6 key digits so we take 123456
10000 needs to be stored
so we do
123456 MOD 10000 = 12.3456
3456 is the address of location as it is the remainder part.
Hey dude im going to do the paper 12 tomorrow, is it really that june 2007 is the key for tomorrow?

 

[RatJumper]

dude do u have msn or facebook so we can talk properly?

 

[akii]

[email protected]

 

[EvilAngel]

Guys my exam is tomorrow and i only just realised i didnt learn about hashing and have no idea on how to answer this question:

May/June 2007 Q12 (b)

Any help would be greatly appreciated.

Thankx

(i)input no. of memory locations
input value
divide value by no. of memory locations.
memory address =remainder
store at memory adress
(ii) 123456 and 223456 or 333456 if divided by 10000 gives u same remainder...u pick value which give u same remainder..
(iii) 1 save in next possible free space
2 save in overload area...

 

[Tanveer]

everyone can post their email id's so that we can discuss about the next computing paper over msn.

 

[RatJumper]

hey so is it true that today's paper is based on something like the s07 paper?

 

[Tanveer]

hey thnx for askin to revise may 07 it helped alot any help u can provide for da next paper? any suggestions or predictions pls ??