Question
A hash table of size 7 uses h(k) = k mod 7 with linear probing for collision resolution. Keys 10, 3, 17, and 5 are inserted in that order. At which index does the key 5 finally get placed?
More Data Structure Questions
- Which network topology ensures full redundancy but is highly expensive and complex to implement?
- Fibonacci heaps support which operation in O(1) amortized time?
- A max-heap contains n elements. Which operation has worst-case O(log n)?
- Which page replacement algorithm minimizes the number of page faults theoretically but is difficult to implement in practice?
- Which tree traversal gives nodes in non-decreasing order for a BST?
- Which of the following is an example of Polymorphism in Object-Oriented Programming?
- Which of the following best illustrates Encapsulation in Object-Oriented Programming?
- A min-heap contains n distinct elements. An arbitrary element at a known index is decreased in value. What is the worst-case time to restore the heap prope...
- Which of the following best describes the function of the Control Unit (CU) in the CPU?
- Which of the following best describes Abstraction in Object-Oriented Programming (OOP)?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)