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? $3$ $4$ $6$ $7$ DS gateit-2008 data-structures hashing normal + – Ishrat Jahan asked Oct 28, 2014 • edited Dec 31, 2017 by kenzou Ishrat Jahan 5.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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 Prashant. answered Aug 10, 2016 • edited Apr 14, 2019 by akash.dinkar12 Prashant. comment Share Follow See all 0 reply Please log in or register to add a comment.
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 Akash Kanase answered Nov 23, 2015 Akash Kanase comment Share Follow See all 2 Comments See all 2 2 Comments reply S Ram commented Dec 10, 2016 reply Follow Share whats the difference when its said open addressing or closed addressing ? 1 votes 1 votes raja11sep commented Oct 6, 2021 reply Follow Share Separate Chaining = Open Hashing Open Addressing = Closed Hashing 0 votes 0 votes Please log in or register to add a comment.
8 votes 8 votes Answer: D The hash table looks like this at the end: 87,11,13,36,92,4,71,14,-,-,43 Rajarshi Sarkar answered Apr 15, 2015 Rajarshi Sarkar comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes https://youtu.be/q42Dgt0r0c0 rohittulasyan answered Oct 19, 2018 rohittulasyan comment Share Follow See all 0 reply Please log in or register to add a comment.