Data Structure I Mock Test 9

10%

Question 1 of 10

1. In quadratic probing, if the table size is prime, a new element cannot be inserted if the table is half full.

True

False

Question 1 of 10

Question 2 of 10

2. What is the formula used in quadratic probing?

Hash key=(hash(x)+F(i)) mod table size

Hash key=(hash(x)+F(i²)) mod table size

Hash key = key mod table size

H(x) = x mod 17

Question 2 of 10

Question 3 of 10

3. What is the advantage of using a doubly linked list for chaining over singly linked list?

it makes the process of insertion and deletion faster

it takes less memory

it causes less collisions

it is easy to implement

Question 3 of 10

Question 4 of 10

4. What should be the load factor for separate chaining hashing?

0.5

1.5

Question 4 of 10

Question 5 of 10

5. The value of h2(k) can be composite relatively to the hash table size m.

False

True

Question 5 of 10

Question 6 of 10

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

false

true

Question 6 of 10

Question 7 of 10

7. Which among the following is the best technique to handle collision?

Separate chaining

Double hashing

Quadratic probing

Linear probing

Question 7 of 10

Question 8 of 10

8. What is the time complexity of search function in a hash table using list head?

O(1)

O(log n)

O(n)

O(n log n)

Question 8 of 10

Question 9 of 10

9. The case in which a key other than the desired one is kept at the identified location is called?

Chaining

Hashing

Open addressing

Collision

Question 9 of 10

Question 10 of 10

10. What is the search complexity in direct addressing?

O(logn)

O(nlogn)

O(1)

O(n)

Question 10 of 10