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
Phase 1: Examination of Search Methodologies.
- Binary Search: Search duration correlates with the element count, specifically $O(\log n)$. Applicable to sorted arrays only.
- Hashing: With a robust hash function and effective collision management, search time is unaffected by the number of elements, yielding an average complexity of $O(1)$.
- Linear Search: Search duration is $O(n)$, directly proportional to the element count, due to sequential checking.
- Jump Search: Search duration is contingent on element count, with a time complexity of $O(\sqrt{n})$.
Phase 2: Determination.
The optimal choice is (2) Hashing, owing to its search time's independence from element count.
Top Questions on Hashing
- All the elements that hash to the same slot are placed into the same linked list in:
- 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?
- GATE CS - 2022
- Algorithms
- Hashing
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)?
- GATE CS - 2021
- Algorithms
- Hashing
- In search by hashing, we have size of the hash table and the size of list, then:
- Want to practice more? Try solving extra ecology questions todayView All Questions