Hashing Function in Data Structure

1. What is a hash table?

Mark the correct option

A structure that maps values to keys

A structure that maps keys to values

A structure used for storage

A structure used to implement stack and queue

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?

Mark the correct option

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 ' ?

Mark the correct option

less than 1.

less than n.

less than m.

less than n / 2.

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

Mark the correct option

dynamic hashing

static hashing

external hashing

internal hashing

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

Mark the correct option

Diffusion

Replication

Collision

None of the mentioned

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.

Mark the correct option

8, _, _, _, _, _, 10

1, 8, 10, _, _, _, 3

1, _, _, _, _, _,3

1, 10, 8, _, _, _, 3

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

Mark the correct option

It saves time

It saves space

It saves both time and space

None of the mentioned

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

Mark the correct option

r =l + bfr + N

r =l - bfr - N

r =l + bfr - N

r =l * bfr * N

9. What is the load factor?

Mark the correct option

Average array size

Average key size

Average chain length

None of the mentioned

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

Mark the correct option

0.0125

8000

1.25

11. What is direct addressing?

Mark the correct option

Distinct array position for every possible key

Fewer array positions than keys

Fewer keys than array positions

None of the mentioned

12. What is the search complexity in direct addressing?

Mark the correct option

O(n)

O(logn)

O(nlogn)

O(1)

13. What is a hash function?

Mark the correct option

A function has allocated memory to keys

A function that computes the location of the key in the array

A function that creates an array

None of the mentioned

14. What can be the techniques to avoid collision?

Mark the correct option

Make the hash function appear random

Use the chaining method

Use uniform hashing

All of the mentioned

15. What is simple uniform hashing?

Mark the correct option

Every element has equal probability of hashing into any of the slots

A weighted probabilistic method is used to hash elements into the slots

All of the mentioned

None of the mentioned

16. In simple uniform hashing, what is the search complexity?

Mark the correct option

O(n)

O(logn)

O(nlogn)

O(1)

17. In simple chaining, what data structure is appropriate?

Mark the correct option

Singly linked list

Doubly linked list

Circular linked list

Binary trees

18. Which of these are core interfaces in the collection framework. Select the one correct answer.

Mark the correct option

Tree

Stack

Queue

Map

19. 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?

Mark the correct option

9679, 1989, 4199 hash to the same value

1471, 6171 hash to the same value

. All elements hash to the same value

Each element hashes to a different value

Home

Courses

Papers

Online Tests

Channels

Categories

Hashing Function in Data Structure

@T-Bone

Questions

1. What is a hash table?

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?

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 ' ?

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

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

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

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

9. What is the load factor?

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

11. What is direct addressing?

12. What is the search complexity in direct addressing?

13. What is a hash function?

14. What can be the techniques to avoid collision?

15. What is simple uniform hashing?

16. In simple uniform hashing, what is the search complexity?

17. In simple chaining, what data structure is appropriate?

18. Which of these are core interfaces in the collection framework. Select the one correct answer.

19. 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

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19