CUET-UG SERIES Computer-science
Hashing
2 previous year questions.
Volume: 2 Ques
Yield: Medium
High-Yield Trend
2
2023 Chapter Questions 2 MCQs
01
PYQ 2023
medium
computer-science ID: cuet-ug-
In search by hashing, we have size of the hash table and the size of list, then:
1
Size of hash table is always smaller than size of list
2
Size of hash table always equal to size of list
3
Size of list is always greater than size of hashtable
4
Size of hash table can be greater than the size of the list
02
PYQ 2023
medium
computer-science ID: cuet-ug-
Which of the following is(are) true for hashing
(A) The time required to compute the index value is independent of the number of items in the list
(B) The time required to compute the index value depend on the number of items in the list
(C) The cost of computing a hash function does not affect the performance of hashing based searching
(D) The time taken by different hash functions may be different
(E) There is no problem of collision in hashing
Choose the correct answer from the options given below :
(A) The time required to compute the index value is independent of the number of items in the list
(B) The time required to compute the index value depend on the number of items in the list
(C) The cost of computing a hash function does not affect the performance of hashing based searching
(D) The time taken by different hash functions may be different
(E) There is no problem of collision in hashing
Choose the correct answer from the options given below :
1
(B), (C) and (E) only
2
(A), (D) and (E) only
3
(B) and (C) only
4
(A) and (D) only