Time Left - 15:00 mins
GATE 2019 - Algorithms Quiz-8 ( Hashing ) (App update required to attempt this test)
Attempt now to get your rank among 559 students!
Question 1
Consider a hash table of size 10 Hashing is done using the hash function as :
Hf(Key) = key mod 8
Find the number of collisions _________ when the follows keys are inserted in hash table in given order if linear probing is used.
25, 39, 46, 55, 89, 23, 68
Question 2
Consider the hashing table with ‘m’ slots and ‘n’ keys. If the expected number of probes in unsuccessful search is 3 then find the expected number of probes in a successful search.
Question 3
A hash table has space for 100 records. Then the probability of collision before the table is 10% full is
Question 4
Which one of the following hash functions on integers will distribute keys most uniformly over 10 buckets numbered 0 to 9 for i ranging from 0 to 2020?
Question 5
Given a hash table T with 25 slots that stores 2000 elements, the load factor α for T is____________.
Question 6
Given the following input (4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199) and the hash function x mod 10, which of the following statements are true?
i) 9679, 1989, 4199 hash to the same value
ii) 1471, 6171 has to the same value
iii) All elements hash to the same value
iv) Each element hashes to a different value
i) 9679, 1989, 4199 hash to the same value
ii) 1471, 6171 has to the same value
iii) All elements hash to the same value
iv) Each element hashes to a different value
- 559 attempts
- 0 upvotes
- 7 comments
Tags :
GATE & PSU CSAlgorithmsJul 4GATE & PSU CS
