edited by
9,767 views
24 votes
24 votes

Given the following input $(4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199)$ and the hash function $x$ mod $10$, which of the following statements are true?

  1. $9679, 1989, 4199$ hash to the same value

  2. $1471, 6171$ hash to the same value

  3. All elements hash to the same value

  4. Each element hashes to a different value

  1. I only
  2. II only
  3. I and II only
  4. III or IV
edited by

5 Answers

Best answer
21 votes
21 votes

Option C is correct answer because the last digit of every digit given is equal in I and II.

edited by
13 votes
13 votes

This might Help to understand better

Answer:

Related questions

27 votes
27 votes
3 answers
1
Kathleen asked Sep 18, 2014
5,590 views
The elements $32, 15, 20, 30, 12, 25, 16,$ are inserted one by one in the given order into a maxHeap. The resultant maxHeap is
19 votes
19 votes
3 answers
2
Kathleen asked Sep 18, 2014
6,384 views
Level order traversal of a rooted tree can be done by starting from the root and performingpreorder traversalin-order traversaldepth first searchbreadth first search
19 votes
19 votes
4 answers
3
Kathleen asked Sep 18, 2014
6,939 views
The best data structure to check whether an arithmetic expression has balanced parentheses is aqueuestacktreelist
27 votes
27 votes
6 answers
4
Kathleen asked Sep 18, 2014
22,413 views
The following numbers are inserted into an empty binary search tree in the given order: $10, 1, 3, 5, 15, 12, 16$. What is the height of the binary search tree (the heigh...