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. What is the use of a hash function?

2. What is the disadvantage of BST over the hash table?

3. Which technique was firstly used clustering documents using the similarity of two words or strings?

4. ___________ is not a theoretical problem but actually occurs in real implementations of probing.

5. What is the advantage of a hash table over BST?

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

7. What are the values of h1(k) and h2(k) in the hash function?

8. Sequential access in a Hash tree is faster than in B-trees.

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

10. What is the time complexity of insert function in a hash table using a doubly linked list?


 

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.