edited by
8,008 views
0 votes
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
edited by

1 Answer

Best answer
5 votes
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:

Related questions

0 votes
0 votes
2 answers
1
go_editor asked Jul 11, 2016
4,888 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 votes
3 votes
2 answers
2
go_editor asked Jul 8, 2016
6,582 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
2 votes
2 votes
1 answer
3
im.raj asked Jun 16, 2016
5,352 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...
4 votes
4 votes
2 answers
4
go_editor asked Jul 11, 2016
4,400 views
The maximum number of keys stored in a B-tree of order $m$ and depth $d$ is$m^{d +1}-1$$\frac{m^{d+1}-1}{m-1}$$(m-1)(m^{d+1}-1)$$\frac{m^d-1}{m-1}$