## Hashing Function MCQ

1. What is a hash table?

A. A structure that maps values to keys

B. A structure that maps keys to values

C. A structure used for storage

D. A structure used to implement stack and queue

View Answer

Ans : B

Explanation: A hash table is used to implement associative arrays which has a key-value pair, so the has table maps keys to values.

2. How many different insertion sequences of the key values using the same hash function and linear probing will result in the hash table shown above?

A. 10

B. 20

C. 30

D. 40

View Answer

Ans : C

Explanation: In a valid insertion sequence, the elements 42, 23 and 34 must appear before 52 and 33, and 46 must appear before 33.

Total number of different sequences = 3! x 5 = 30

In the above expression, 3! is for elements 42, 23 and 34 as they can appear in any order, and 5 is for element 46 as it can appear at 5 different places.

3. If ' h ' is a hashing function and it is used to hash ' n ' keys into a table of size ' m ' where n <= m . What is the expected number of collisions involving a particular key ' x ' ?

A. less than 1.

B. less than n.

C. less than m.

D. less than n / 2.

View Answer

Ans : A

Explanation: No Explanation

4.Hashing technique which allocates fixed number of buckets is classified as

A. dynamic hashing

B. static hashing

C. external hashing

D. internal hashing

View Answer

Ans : C

Explanation:Hashing technique which allocates fixed number of buckets is classified as external hashing.

5.If several elements are competing for the same bucket in the hash table, what is it called?

A. Diffusion

B. Replication

C. Collision

D. None of the mentioned

View Answer

Ans : C

Explanation:If several elements are competing for the same bucket in the hash table, is it called Collision.

6. Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.

A. 8, _, _, _, _, _, 10

B. 1, 8, 10, _, _, _, 3

C. 1, _, _, _, _, _,3

D. 1, 10, 8, _, _, _, 3

View Answer

Ans : B

Explanation: hashing and probing. Let us put values 1, 3, 8, 10 in the hash of size 7. Initially, hash table is empty

- - - - - - -

0 1 2 3 4 5 6

The value of function (3x + 4)mod 7 for 1 is 0, so let us put the value at 0

1 - - - - - -

0 1 2 3 4 5 6

The value of function (3x + 4)mod 7 for 3 is 6, so let us put the value at 6

1 - - - - - 3

0 1 2 3 4 5 6

The value of function (3x + 4)mod 7 for 8 is 0, but 0 is already occupied, let us put the value(8) at next available space(1)

1 8 - - - - 3

0 1 2 3 4 5 6

The value of function (3x + 4)mod 7 for 10 is 6, but 6 is already occupied, let us put the value(10) at next available space(2)

1 8 10 - - - 3

0 1 2 3 4 5 6

7. What is the advantage of using a dynamic set in direct addressing?

A. It saves time

B. It saves space

C. It saves both time and space

D. None of the mentioned

View Answer

Ans : B

Explanation: Using a dynamic set, the size of the array is restricted to the number of keys, hence saves space.

8. In linear hashing, formula used to calculate number of records if blocking factor, loading factor and file buckets are known is as

A. r =l + bfr + N

B. r =l - bfr - N

C. r =l + bfr - N

D. r =l * bfr * N

View Answer

Ans : D

Explanation: No Explanation

9. What is the load factor?

A. Average array size

B. Average key size

C. Average chain length

D. None of the mentioned

View Answer

Ans : C

Explanation:In simple chaining, load factor is the average number of elements stored in a chain, and is given by the ratio of number of elements stored to the number of slots in the array.
.

10. Given a hash table T with 25 slots that stores 2000 elements, the load factor α for T is __________

A. 80

B. 0.0125

C. 8000

D. 1.25

View Answer

Ans : A

Explanation:load factor = (no. of elements) / (no. of table slots) = 2000/25 = 80.

**Also Check : **

Discussion