Register

GATE IT 2008 | Question: 48

• edited by
5,900 views
16 votes
16 votes

Consider a hash table of size $11$ that uses open addressing with linear probing. Let $h(k) = k \mod 11$ be the hash function used. A sequence of records with keys

$43 \ 36 \ 92 \ 87 \ 11 \ 4 \ 71 \ 13 \ 14$

is inserted into an initially empty hash table, the bins of which are indexed from zero to ten. What is the index of the bin into which the last record is inserted?

  1. $3$
  2. $4$
  3. $6$
  4. $7$
• edited by
User Avatar

4 Answers

Best answer
25 votes
25 votes

$$\begin{array}{|c|c|} \hline \textbf{Index} &  \textbf{key}\\\hline 0 & 87 \\\hline 1 & 11 \\\hline 2 & 13 \\\hline 3 & 36 \\\hline 4 & 92 \\\hline 5 & 4 \\\hline 6 & 71 \\\hline \textbf{7} & \textbf{14} \\\hline 8 \\\hline 9 \\\hline 10 & 43 \\\hline  \end{array}$$

(D) is answer

• edited by
User Avatar
9 votes
9 votes

Answer D

Index Key
0 87
1 11
2 13
3 36
4 92
5 4
6 71
7 14
8  
9  
10 43
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

42 votes
42 votes
5 answers
2
Ishrat Jahan asked Oct 29, 2014
16,921 views
GATE IT 2008 | Question: 76
A binary tree with $n > 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respec­tively. The degree of a node is defined as the number of its neighbours. $n_3$ can be expressed as $n_1 + n_2 - 1$ $n_1 -2$ $[((n_1 + n_2)/2)]$ $n_2 - 1$
A binary tree with $n 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respec­tively. The degree of a node is defined as the number of its neighbo...
User Avatar
32 votes
32 votes
2 answers
3
Ishrat Jahan asked Oct 29, 2014
12,536 views
GATE IT 2008 | Question: 73
How many distinct BSTs can be constructed with $3$ distinct keys? $4$ $5$ $6$ $9$
How many distinct BSTs can be constructed with $3$ distinct keys?$4$$5$$6$$9$
User Avatar
Link Copied!