📚 Question Bank Q31 — Programming and Data Structure
Tags
Programming and Data Structure
Q31. Marks: +2.0 UGC NET Paper 2: Computer Science and Application 26th June 2025 Shift 1
Match List I with List II
List I (Hashing Collison Handling Method) List II (Strategy)
A. Chaining I. Check next slot
B. Linear Probing II. Use second hash function
C. Quadratic Probing III. Linked list at index
D. Double Hashing IV. Skip slots using quadratic step
Choose the correct answer from the options given below:
1.A-II, B-III, C-I, D-IV
2.A-II, B-III, C-IV, D-I
3.A-III, B-I, C-IV, D-II ✓ Correct
4.A-IV, B-II, C-I, D-III
📄 All “Programming and Data Structure” questions across papers
🏷 Change Tag for this Question