Division Reminder Method

        In division reminder method, key k is divided by a number m larger than the number n of keys in k and the remainder of this division is taken as index into the hash table i.e.

                                    H (k) = K mod m

        The number m is usually chosen to be a prime number or a number without small divisors, since this frequently minimizes the number of collisions.

         The above hash function will map the keys in the range 0 to m-1and is acceptable in c/c ++. But if we want the hash addresses to range from 1 to m rather than from 0 to m-1 we use the formula

                                    H (k) = k mod m+1

Data Structure & Algorithms Assignment Help, Live Experts

Struggling with data structure problems? Data structure subject is quite tough to learn? Need quick assistance in data structure questions? ExpertsMind.com is right place for you where your search ends, We at ExpertsMind offer online data structure assignment help, data structure homework help and data structure and algorithms question's answers by best online support by qualified tutors.

ExpertsMind.com - Division Reminder Method Assignment Help, Division Reminder Method Homework Help, Division Reminder Method Assignment Tutors, Division Reminder Method Solutions, Division Reminder Method Answers, Define Hashing Assignment Tutors