Register

Test by Bikram | Data Structures | Test 2 | Question: 22

• edited by
4,333 views
2 votes
2 votes

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$
• edited by
User Avatar

1 Answer

Best answer
0 votes
0 votes
Using modulo 11 arithmetic and linear probing gives these values 99, 100, __, 113, 114, __, 116, 117, 105, 97, 108
• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
Bikram asked Nov 26, 2016
1,663 views
Test by Bikram | Data Structures | Test 2 | Question: 29
Three algorithms do the same task. Algorithm One is $O(N)$ and Algorithm Two is $O(\log N)$ and Algorithm Three is $O(N1/2)$. Which algorithm should execute the fastest for large values of $N$? $O(N1/2)$ $O(N)$ $O(\log N)$ both A and B
Three algorithms do the same task. Algorithm One is $O(N)$ and Algorithm Two is $O(\log N)$ and Algorithm Three is $O(N1/2)$. Which algorithm should execute the fastest f...
User Avatar
1 votes
1 votes
3 answers
3
Bikram asked Nov 26, 2016
813 views
Test by Bikram | Data Structures | Test 2 | Question: 28
A circular linked list is used to represents a queue. A single variable L is used to access the queue. To which node should L point such that both the operation enqueue and dequeue can be performed in constant time ? node next to front front node not possible with a single node rear node
A circular linked list is used to represents a queue. A single variable L is used to access the queue. To which node should L point such that both the operation enqueue a...
User Avatar
0 votes
0 votes
0 answers
4
Bikram asked Nov 26, 2016
392 views
Test by Bikram | Data Structures | Test 2 | Question: 26
Suppose letters a,b,c,d,e,f have probabilities ½, ¼, 1/8, 1/16, 1/32, 1/32. Which of the following is the Huffman code for the letters a,b,c,d,e,f. 0, 10, 110, 1110, 11110, 11111 11, 10, 01, 001, 0001, 0000 11, 10, 011, 010, 001, 000 110, 100, 010, 000, 001, 111
Suppose letters a,b,c,d,e,f have probabilities ½, ¼, 1/8, 1/16, 1/32, 1/32. Which of the following is the Huffman code for the letters a,b,c,d,e,f.0, 10, 110, 1110, 111...
User Avatar
Link Copied!