Hashing MCQ question and answer with solution | Data Structure MCQs Page-1 section-2

1.
What is the time complexity to insert an element into the direct address table?

A. O(n)

B. O(logn)

C. O(nlogn)

D. O(1)

Answer & Solution Discuss in Board Save for Later

2.
What will be the height of the hash tree with branching factor 2 and with 8 records?

A. 3

B. 5

C. 4

D. 6

Answer & Solution Discuss in Board Save for Later

3.
What is the hash function used in Double Hashing?

A. (h1(k) - i*h2(k))mod m

B. h1(k) + h2(k)

C. (h1(k) + i*h2(k))mod m

D. (h1(k) + h2(k))mod m

Answer & Solution Discuss in Board Save for Later

4.
Which of the following is not a technique to avoid a collision?

A. Make the hash function appear random

B. Use the chaining method

C. Use uniform hashing

D. Increasing hash table size

Answer & Solution Discuss in Board Save for Later

5.
What is the advantage of a hash table as a data structure?

A. faster access of data

B. easy to implement

C. very efficient for less number of entries

D. exhibit good locality of reference

Answer & Solution Discuss in Board Save for Later

6.
Which of the following is the correct function definition for quadratic probing?

A. F(i)=i²

B. F(i)=i

C. F(i)=i+1

D. F(i)=i²+1

Answer & Solution Discuss in Board Save for Later

7.
Which of the following techniques offer better cache performance?

A. Quadratic probing

B. Linear probing

C. Double hashing

D. Rehashing

Answer & Solution Discuss in Board Save for Later

8.
What is the hash function used in linear probing?

A. H(x)= key mod table size

B. H(x)= (key+ F(i²)) mod table size

C. H(x)= (key+ F(i)) mod table size

D. H(x)= X mod 17

Answer & Solution Discuss in Board Save for Later

9.
Separate chaining is easier to implement as compared to open addressing.

A. true

B. false

Answer & Solution Discuss in Board Save for Later

10.
Is MinHash used as a tool for association rule learning.

A. True

B. False

Answer & Solution Discuss in Board Save for Later

Hashing MCQ question and answer with solution | Data Structure MCQs

1. What is the time complexity to insert an element into the direct address table?

Answer & Solution

2. What will be the height of the hash tree with branching factor 2 and with 8 records?

Answer & Solution

3. What is the hash function used in Double Hashing?

Answer & Solution

4. Which of the following is not a technique to avoid a collision?

Answer & Solution

5. What is the advantage of a hash table as a data structure?

Answer & Solution

6. Which of the following is the correct function definition for quadratic probing?

Answer & Solution

7. Which of the following techniques offer better cache performance?

Answer & Solution

8. What is the hash function used in linear probing?

Answer & Solution

9. Separate chaining is easier to implement as compared to open addressing.

Answer & Solution

10. Is MinHash used as a tool for association rule learning.

Answer & Solution

Read More Section(Hashing)

1.
What is the time complexity to insert an element into the direct address table?

2.
What will be the height of the hash tree with branching factor 2 and with 8 records?

3.
What is the hash function used in Double Hashing?

4.
Which of the following is not a technique to avoid a collision?

5.
What is the advantage of a hash table as a data structure?

6.
Which of the following is the correct function definition for quadratic probing?

7.
Which of the following techniques offer better cache performance?

8.
What is the hash function used in linear probing?

9.
Separate chaining is easier to implement as compared to open addressing.

10.
Is MinHash used as a tool for association rule learning.