Contents
Chapter 3 · SoftwarePractice
← Return to textbook

CONCEPT PRACTICE

Hash division remainder calculation

1 related published questions. Take them one at a time.

Filter questions
Question sources

1 of 1 questions match.

ITPEC Practice
0/1 answered

Question 1 of 1

0/1 answered

2023 Spring · Morning · Q9

Original exam question · Select the image to enlarge
Read the question as text

Q9. A five-digit number a1a2a3a4a5 needs to be stored in an array by means of hashing. When the hash function is mod (a1+a2+a3+a4+a5, 13) and the number is stored in the array element at the position corresponding to the calculated hash value, which of the following is the position where 54321 is stored in the array? Here, the value of mod (x, 13) is the remainder after dividing x by 13. Position Array 0 1 2 ... ... 11 12 Source visual transcription: Array positions0,1,2,…,11,12 are initially empty. Hash position is mod(a1+a2+a3+a4+a5,13).

The original image above preserves the complete exam wording and layout.

Choose your answer
Choose an option to check your answer.
1 / 1Back to lesson →

Source: 2023S_FE_AM_Questions.pdf, PDF page 6. ID: 2023S-AM-Q009. Explanation written for this textbook.

Original question · Q9
Q9. A five-digit number a1a2a3a4a5 needs to be stored in an array by means of hashing. When the hash function is mod (a1+a2+a3+a4+a5, 13) and the number is stored in the array element at the position corresponding to the calculated hash value, which of the following is the position where 54321 is stored in the array? Here, the value of mod (x, 13) is the remainder after dividing x by 13. Position Array 0 1 2 ... ... 11 12 Source visual transcription: Array positions0,1,2,…,11,12 are initially empty. Hash position is mod(a1+a2+a3+a4+a5,13).

Scroll horizontally to read the image at full size.