A computer room has 36 computers, numbered from 0 to 35. Assign a computer to each of the following students by the hashing function h(k) = k mod 36 where k is the class number of the student. Solve the problem when a collision occurs (In case of collisions, the computer number will usually be assigned to the next available storage location). (i) Student number of Jerry: 138 (ii) Student number of Ray: 36 (iii) Student number of Ivy: 34 (iv) Student number of Lucy: 66 (v) Student number of Ivan: 124

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter2: The Integers
Section2.7: Introduction To Coding Theory (optional)
Problem 12E: Suppose that the check digit is computed as described in Example . Prove that transposition errors...
icon
Related questions
Question
(b) A computer room has 36 computers, numbered from 0 to 35. Assign a computer to each
of the following students by the hashing function h(k)= k mod 36 where k is the
class number of the student. Solve the problem when a collision occurs (In case of
collisions, the computer number will usually be assigned to the next available storage
location).
(i) Student number of Jerry: 138
(ii) Student number of Ray: 36
(iii) Student number of Ivy: 34
(iv) Student number of Lucy: 66
(v) Student number of Ivan: 124
Transcribed Image Text:(b) A computer room has 36 computers, numbered from 0 to 35. Assign a computer to each of the following students by the hashing function h(k)= k mod 36 where k is the class number of the student. Solve the problem when a collision occurs (In case of collisions, the computer number will usually be assigned to the next available storage location). (i) Student number of Jerry: 138 (ii) Student number of Ray: 36 (iii) Student number of Ivy: 34 (iv) Student number of Lucy: 66 (v) Student number of Ivan: 124
Expert Solution
steps

Step by step

Solved in 4 steps

Blurred answer