Question

Which of the following statement(s) is/are true?

A. When two elements map to the same slot in hash table, it is called hashing.
B. Linear search takes a sorted list and divides it in the middle.
C. Modulo division method is a Hashing method.
D. Traversing specifies whether the key is present in the list or not.
E. Binary search takes a sorted/ordered list and divides it in the middle.

• A. A and B only
• B. A, B, and C only
• C. B and D only
• D. C and E only

Hint:

In hash tables, collisions are handled by hashing methods like modulo division, while binary search requires sorted lists.

Answer 1

The Correct Option is B

- Statement A is true as the collision in hash tables is handled by hashing methods.
- Statement B is false since linear search doesn't require a sorted list and doesn't divide it in the middle.
- Statement C is true as the modulo division method is often used in hash functions.
- Statement D is true, traversal involves checking whether the key exists in the list or not.
- Statement E is true as binary search works on sorted lists and divides them in the middle.
Thus, the correct statements are A, B, and C.