In ................. the search time is independent of the number of elements $n$.
Show Hint
- Binary Search
- Hashing
- Linear Search
- Jump Search
The Correct Option is B
Solution and Explanation
Step 1: Analysis of Search Techniques.
- **Binary Search**: The search time in binary search is dependent on the number of elements, specifically **$O(\log n)$**. It works on sorted arrays.
- **Hashing**: In hashing, the time for searching an element is independent of the number of elements, assuming a good hash function and proper collision resolution, giving **$O(1)$** average time complexity.
- **Linear Search**: The search time in linear search is **$O(n)$**, dependent on the number of elements, as it checks each element one by one.
- **Jump Search**: Jump Search also depends on the number of elements but has a time complexity of **$O(\sqrt{n})$**.
Step 2: Conclusion.
The correct answer is **(2) Hashing**, as search time is independent of the number of elements.
Top Questions on Hashing
- All the elements that hash to the same slot are placed into the same linked list in:
- In search by hashing, we have size of the hash table and the size of list, then:
- 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 : - Suppose we are given \(n\) keys, \(m\) hash table slots, and two simple uniform hash functions \(h_1\) and \(h_2\). Further suppose our hashing scheme uses \(h_1\) for the odd keys and \(h_2\) for the even keys. What is the expected number of keys in a slot?
Consider a dynamic hashing approach for 4-bit integer keys:
- There is a main hash table of size 4.
- The 2 least significant bits of a key are used to index into the main hash table.
- Initially, the main hash table entries are empty.
- To resolve collisions, the set of keys corresponding to a main hash table entry is organized as a binary tree that grows on demand.
- First, the 3rd least significant bit is used to divide the keys into left and right subtrees.
- Further collisions are resolved by subdividing based on the 4th least significant bit.
- A split is done only if needed, i.e., only when there is a collision.
Consider the following state of the hash table. Which of the following sequences of key insertions can cause the above state of the hash table (assume the keys are in decimal notation)?
Questions Asked in CUET PG exam
- A bought an article at a certain price and sold it at 10% profit. B bought the same article at a price 10% lesser than A and sold it at ₹18 lesser than A. B's gain percentage in this deal is 20%. At what price B bought the article?
- CUET (PG) - 2025
- Profit and Loss
- The traffic lights at three different road crossings change after every 48 seconds, 72 seconds and 108 seconds respectively. If they all change simultaneously at 8:20:00 hours, then at what time will they again change simultaneously?
- CUET (PG) - 2025
- Quantitative Aptitude
- In terracotta which materials are mainly used to build strong clay
(A) Grog
(B) Metal
(C) Cotton
(D) Stone
Choose the correct answer from the options given below:- CUET (PG) - 2025
- Ceramics and Pottery
- Under the Protection of Women from Domestic Violence Act, 2005, the definition of "domestic relationship" includes:
- CUET (PG) - 2025
- Social Legislation
- The mezzotint method invented by Lindberg Von Sleigen is a version of:
- CUET (PG) - 2025
- Printmaking Techniques