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
About Hashing - CUET-UG
Hashing is a vital chapter for CUET-UG aspirants. Mastering the concepts covered in this chapter is essential for securing a top rank.
By rigorously practicing the previous year questions associated with this chapter, you can identify high-yield topics, understand the examiner's perspective, and boost your confidence during the actual exam.
Frequently Asked Questions
Why focus on Hashing PYQs?
Analyzing PYQs for this specific chapter reveals the most frequently tested concepts and the typical complexity of questions, allowing you to tailor your study plan efficiently.
How to best use this analysis?
Review the topic breakdown to see which sub-topics within Hashing carry the most weight. Then, tackle the questions iteratively to solidify your understanding.