edited by
10,441 views
0 0 votes

A hash function $f$ defined as $f (key) = key \mod 13$, with linear probing is used to insert keys 55, 58, 68, 91, 27, 145. What will be the location of 79?

  1. 1
  2. 2
  3. 3
  4. 4

1 Answer

Best answer
5 5 votes

Answer: location for key 79 (assuming it is inserted at end) is not available in option.

Key           Location
55 3
58 6
68 4
91 0
27 1
145 2
79 5(Answer)
selected by
Answer:
Position:
Show:

Related questions

59 59 votes
4 answers 4 answers
24.8k
24.8k views
Arjun asked Feb 12, 2020
24,810 views
Consider a double hashing scheme in which the primary hash function is $h_1(k)= k \text{ mod } 23$, and the secondary hash function is $h_2(k)=1+(k \text{ mod } 19)$. Ass...
0 0 votes
2 answers 2 answers
5.6k
5.6k views
go_editor asked Jul 11, 2016
5,593 views
Given an empty stack, after performing push(1), push(2), pop, push(3), push(4), pop, pop, push(5), pop, what is the value of the top of the stack?4321
3 3 votes
2 2 answers
8.9k
8.9k views
go_editor asked Jul 8, 2016
8,930 views
In which tree, for every node the height of its left subtree and right subtree differ almost by 1?Binary Search TreeAVL TreeThreaded Binary TreeComplete Binary Tree
4 4 votes
1 answers 1 answer
6.4k
6.4k views
im.raj asked Jun 16, 2016
6,439 views
The worst case time complexity of AVL is tree is better in comparison to binary search tree forSearch and Insert OperationsSearch and Delete OperationsInsert and Delete O...