Data Science interview questions part 1
Data Science interview questions part 1
Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. Point out the correct statement:
Correct Answer is : Raw data is original source of data
2. Which of the following is performed by Data Scientist ?
Correct Answer is : All of the Mentioned
3. Which of the following is most important language for Data Science ?
Correct Answer is : R
4. Point out the wrong statement:
Correct Answer is : Data visualization is the organization of information according to preset specifications
5. Which of the following approach should be used to ask Data Analysis question ?
Correct Answer is : Find out the question which is to be answered
6. What can be the value of m in the division method?
Correct Answer is : Confounding
7. Which scheme provides good performance?
Correct Answer is : If equations are known but the parameters are not,they may be inferred with data analysis
8. Using division method, in a given hash table of size 157, the key of value 172 be placed at position ____
Correct Answer is : question
9. How many steps are involved in creating a hash function using a multiplication method?
Correct Answer is : randomize it
10. What is the hash function used in multiplication method?
Correct Answer is : Randomized studies are not used to identify causation
11. What is the advantage of the multiplication method?
Correct Answer is : All of the Mentioned
12. What is the table size when the value of p is 7 in multiplication method of creating hash functions?
Correct Answer is : None of the Mentioned
13. What is the value of h(k) for the key 123456? Given: p=14, s=2654435769, w=32
Correct Answer is : Data Dredging
14. Collisions can be reduced by choosing a hash function randomly in a way that is independent of the keys that are actually to be stored.
Correct Answer is : FALSE
15. In a max-heap, element with the greatest key is always in the which node?
Correct Answer is : Data Science
16. Heap exhibits the property of a binary tree?
Correct Answer is : Raw data is original source of data
17. What is the complexity of adding an element to the heap.
Correct Answer is : All of the Mentioned
18. The worst case complexity of deleting any arbitrary node value element from heap is
Correct Answer is : R
19. Heap can be used as ________________
Correct Answer is : Data visualization is the organization of information according to preset specifications
20. If we implement heap as min-heap , deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
Correct Answer is : Find out the question which is to be answered
