Hash Tables – PROBLEM -Collisions
{"Image DocumentName": "Hash Tables \u2013 PROBLEM -Collisions", "Image ImageDescription": "With this hash function. int hash( char []s, int n ) { int sum = 0, i = 0; while( n-- > 0 ) sum = sum + s[i++].getNumericValue; return sum % 256; } FOR: hash( AB , 2 ) and hash( BA , 2 ) their Ascii (Unicode) values return the same value! Unicode value A is 65, for B is 66. Add them together in any order and they equal 131. This is called a collision.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}