Suppose there are eight students with IDs 106500361, 120987540, 132490004, 134052199, 153450900, 175342111, 187800977, and 198966574. Suppose hash table, HT, is of the size 19, indexed 0, 1, 2, . . ., 18. Show how these students’ IDs, in the order given, are inserted in HT using the hashing function h(k)= k % 19. Use linear probing to resolve collision. IDs HT index 106500361 120987540 132490004 134052199 153450900 175342111 187800977 198966574
Suppose there are eight students with IDs 106500361, 120987540, 132490004, 134052199, 153450900, 175342111, 187800977, and 198966574. Suppose hash table, HT, is of the size 19, indexed 0, 1, 2, . . ., 18. Show how these students’ IDs, in the order given, are inserted in HT using the hashing function h(k)= k % 19. Use linear probing to resolve collision. IDs HT index 106500361 120987540 132490004 134052199 153450900 175342111 187800977 198966574
Related questions
Question
Suppose there are eight students with IDs 106500361, 120987540, 132490004, 134052199, 153450900, 175342111, 187800977, and 198966574. Suppose hash table, HT, is of the size 19, indexed 0, 1, 2, . . ., 18. Show how these students’ IDs, in the order given, are inserted in HT using the hashing function h(k)= k % 19. Use linear probing to resolve collision.
IDs |
HT index |
106500361 |
|
120987540 |
|
132490004 |
|
134052199 |
|
153450900 |
|
175342111 |
|
187800977 |
|
198966574 |
|
AI-Generated Solution
Unlock instant AI solutions
Tap the button
to generate a solution