Data Science interview questions part 5
Data Science interview questions part 5
Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. Who is the ancestor of Node H?
Correct Answer is : FALSE
2. Who is descendant of Node C?
Correct Answer is : scikit-learn
3. What is the size of Node B in given K-ary tree?
Correct Answer is : Seaborn
4. Can leaf node be called child node in a K-ary tree?
Correct Answer is : TRUE
5. Can child node be always called Leaf node in the K-ary tree?
Correct Answer is : SparseArray
6. What is the upper bound for maximum leaves in K-ary tree with height h?
Correct Answer is : All of the Mentioned
7. What is the height of a K-ary tree having only root node?
Correct Answer is : None of the Mentioned
8. Which one of the following is the correct formulae to find the parent node at index I?
Correct Answer is : SparseList
9. Which nodes are the siblings of Node D of given ternary tree?
Correct Answer is : to_array. append can accept scalar values or any 2-dimensional sequence
10. How many extra nodes are there in Full K-ary tree than complete K-ary tree?
Correct Answer is : SparseSeries.to_coo()
11. Is Node A sibling of Node B in the given K-ary tree?
Correct Answer is : FALSE
12. In what time can a 2-d tree be constructed?
Correct Answer is : in
13. Insertion into a 2-d tree is a trivial extension of insertion into a binary search tree.
Correct Answer is : ix
14. In a two-dimensional search tree, the root is arbitrarily chosen to be?
Correct Answer is : TRUE
15. Which of the following is the simplest data structure that supports range searching?
Correct Answer is : all of the Mentioned
16. In a k-d tree, k originally meant?
Correct Answer is : NaN is the standard missing data marker used in pandas
17. What will be the correct sequence of insertion for the following k-d tree?
Correct Answer is : union
18. Each level in a k-d tree is made of?
Correct Answer is : All of the Mentioned
19. What is the worst case of finding the nearest neighbour?
Correct Answer is : A DataFrame is like a fixed-size dict in that you can get and set values by index label
20. What is the run time of finding the nearest neighbour in a k-d tree?
Correct Answer is : DataFrame.from_items
