My Report (&Account)

Direct Address Table Test


Correct Answer: 2 points | Wrong: -1 point
Grades: A* (100% score) | A (80%-99%) | B (60%-80%) | C (40%-60%) | D (0%-40%)

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

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

3. For the given hash table, in what location will the element 58 be hashed using quadratic probing?

0 49
1
2
3
4
5
6
7
8 18
9 89

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

5. Which of the following schemes does quadratic probing come under?

6. Quadratic probing overcomes primary collision.

7. What kind of deletion is implemented by hashing using open addressing?

8. How many constraints are to be met to successfully implement quadratic probing?

9. What is the formula used in quadratic probing?

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


 

Start practicing “1000 MCQs on Data Structure”, and once you are ready, you can take tests on all topics by attempting our “Data Structure Test Series”.

advertisement
advertisement
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.