The Gateway to Computer Science Excellence
+1 vote
37 views

Suppose you have  the following set of keys to insert into a hash table that can hold $11$ values. $113, 117, 97, 100, 114, 108, 116, 105, 99$. Which of the following best demonstrates the contents of the hash  table after all the keys have been inserted using linear probing?

  1. $100$, _____, _____ , $113, 114, 105, 116, 117, 97, 108, 99$
  2. $99, 100$, ___, $113, 114$, ___, $116, 117, 105, 97, 108$
  3. $100, 113, 117, 97, 14, 108, 116, 105, 99$, ___, ___
  4. $117, 114, 108, 116, 105, 99$, ___, ___, $97, 100, 113$
in Programming by Veteran (75k points)
edited by | 37 views

1 Answer

0 votes
Best answer
Using modulo 11 arithmetic and linear probing gives these values 99, 100, __, 113, 114, __, 116, 117, 105, 97, 108
by Veteran (75k points)
selected by
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,397 answers
198,610 comments
105,454 users