CSS interview questions part 32
CSS interview questions part 32
Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. In the following given hash table, use linear probing to find the location of 49. 0 1 2 3 4 5 6 7 8 18 9 89 a) 7 b) 6 c) 2 d) 0
Correct Answer is : :checked
2. What is the formula to find the expected number of probes for an unsuccessful search in linear probing?
Correct Answer is : :default
3. Which of the following schemes does quadratic probing come under?
Correct Answer is : :default
4. Quadratic probing overcomes primary collision.
Correct Answer is : :empty
5. What kind of deletion is implemented by hashing using open addressing?
Correct Answer is : :empty
6. In quadratic probing, if the table size is prime, a new element cannot be inserted if the table is half full.
Correct Answer is : :enabled
7. Which of the following is the correct function definition for quadratic probing?
Correct Answer is : :enabled
8. How many constraints are to be met to successfully implement quadratic probing?
Correct Answer is : :first-of-type
9. Which among the following is the best technique to handle collision?
Correct Answer is : :first-of-type
10. Which of the following techniques offer better cache performance?
Correct Answer is : :not(s)
11. What is the formula used in quadratic probing?
Correct Answer is : :not(s)
12. Hash tree is generalization of ______
Correct Answer is : :only-child
13. Hash tree is used in effective data verification in distributed systems.
Correct Answer is : :target
14. Which of the following is a widely used form of the hash tree?
Correct Answer is : :target
15. Which of the following is true for a Hash tree?
Correct Answer is : :valid
16. Hash tree is also known as _____
Correct Answer is : :valid
17. What will be the height of the hash tree with branching factor 2 and with 8 records?
Correct Answer is : column-break-after
18. Where is the hash tree used?
Correct Answer is : column-break-before
19. What is the worst case time complexity of the insertion in the hash tree?
Correct Answer is : column-count
20. Sequential access in a Hash tree is faster than in B-trees.
Correct Answer is : column-gap
