Consider the following cuckoo hashing with 2 tables. Both tables have a size of 11. The hashing function of the first ta
Posted: Sun May 15, 2022 8:28 am
Consider the following cuckoo
hashing with 2 tables. Both tables have a size of
11.
The hashing function of
the first table is:
h1(k)=kmod11
The hashing function of
the second table is:
h2(k)=⌊k11⌋mod11
(Note: mod is the modulo operation.
It returns the remainder of a division. For example, "3 mod 11 = 3"
and "20 mod 11 = 9".)
The following sequence of insert operations are performed:
Which of the following is TRUE after the above operations?
Group of answer choices
53 is in the first table
75 is in the first table
50 is in the second table
The second table is empty
The first table is empty
hashing with 2 tables. Both tables have a size of
11.
The hashing function of
the first table is:
h1(k)=kmod11
The hashing function of
the second table is:
h2(k)=⌊k11⌋mod11
(Note: mod is the modulo operation.
It returns the remainder of a division. For example, "3 mod 11 = 3"
and "20 mod 11 = 9".)
The following sequence of insert operations are performed:
Which of the following is TRUE after the above operations?
Group of answer choices
53 is in the first table
75 is in the first table
50 is in the second table
The second table is empty
The first table is empty