My Report

Data Structure I Practice Test 9


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

1. Which scheme uses a randomization approach?

2. What is the table size when the value of p is 7 in multiplication method of creating hash functions?

3. What is the advantage of the multiplication method?

4. The task of generating alternative indices for a node is called?

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

6. A hash table may become full in the case when we use open addressing.

7. What will be the height of the hash tree with branching factor 2 and with 8 records?

8. Where is the hash tree used?

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

10. What is the search complexity in direct addressing?


 

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.