Step 1: Understanding Hashing Methods.
- **Universal hashing**: This method involves choosing a hash function at random to avoid patterns. It does not use linked lists to resolve collisions.
- **Linear Probing**: This technique resolves collisions by finding the next available slot in a linear sequence, not by using linked lists.
- **Quadratic probing**: This is a collision resolution method that checks a quadratic sequence of positions to find an available slot, also without using linked lists.
- **Chaining**: Chaining handles collisions by storing all elements that hash to the same slot in a linked list. This is the correct method where linked lists are used for collision resolution.
Step 2: Conclusion.
Thus, the correct answer is **(4) Chaining**.
Find the next two terms of the series:
The given series is: \( A, C, F, J, ? \).
(A) O
(B) U
(C) R
(D) V
Choose the correct answer from the options given below:
Find the number of triangles in the given figure.
