Interview question based on skill :
Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. How many prime concepts are available in nearest neighbour search in a kd tree?
Correct Answer is : TRUE
2. Reducing search space by eliminating irrelevant trees is known as?
Correct Answer is : DataFrame.from_items
3. Several kinds of queries are possible on a k-d called as?
Correct Answer is : All of the Mentioned
4. What is the time taken for a range query for a perfectly balanced tree?
Correct Answer is : TRUE
5. The 2d search tree has the simple property that branching on odd levels is done with respect to the first key.
Correct Answer is : plt.plot()
6. Who invented k-d trees?
Correct Answer is : all of the Mentioned
7. Pointer manipulation is generally more time-consuming than multiplication and division.
Correct Answer is : barh
8. How many properties does a leftist heap support?
Correct Answer is : scatter_matrix
9. In a leftist heap, the null path length of a null node is defined as?
Correct Answer is : ‘kde’ for hexagonal bin plots
10. How many nodes does a leftist tree with r nodes must have?
Correct Answer is : Lag
11. Which of the following operations does not destroy the leftist heap property?
Correct Answer is : TRUE
12. What is the fundamental operation on leftist heap?
Correct Answer is : Autocorrelation
13. A leftist heap is also said to be a binary heap.
Correct Answer is : Bootstrap
14. What is the efficiency of merge used in leftist heaps?
Correct Answer is : TRUE
15. What is the node path length of a node with 0 or 1 child?
Correct Answer is : idxmax
16. Why is this heap named leftist heap?
Correct Answer is : Timedeltas are differences in times, expressed in difference units
17. In a leftist heap, all the operations should be performed on?
Correct Answer is : Timedelta
18. What would be the result if the left subtree of the root has a null path length of 1 and the right subtree has a null path length of 2?
Correct Answer is : All of the Mentioned
19. What happens if the null path length is not updated?
Correct Answer is : You cannot pass a timedelta to get a particular value
20. What is the time taken to delete a minimum element in a leftist heap?
Correct Answer is : TimedeltaIndex
