Home > Machine Learning 101 > Quizzes > Machine Learning 101 Practice Test: Decision Trees
Machine Learning 101 Practice Test: Decision Trees
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 18% Most missed: “Which of the following is expressed by the given equation Y = β0 + β1X + Ɛ which…”
Quiz on important decision trees concepts including decision tree pruning, inductive bias, classification trees, regression trees, and the powerful Random Forest algorithm.   Decision trees are a type of machine learning algorithm that split a dataset based on specific parameters until a final decision is made. They are one of the most easily explainable types of machine learning models.  Here are some basics about decision trees: Pruning: A technique that simplifies decision trees by reducing the rules. This helps to avoid complexity and improves accuracy. Splitting: Decision trees... Show more
Machine Learning 101 Practice Test: Decision Trees
Time left 00:00
25 Questions

1. Classification trees follow a top-down greedy approach.
2. In Classification trees the value obtained by terminal node in the training data is the mode of observations falling in that region.
3. Which of the following statements is not true about Classification trees?
4. Splitting is the process of dividing a node into two or more sub-nodes.
5. Which of the following statements is not true about the Decision tree?
6. Post pruning is also known as backward pruning.
7. Preference bias is also known as search bias.
8. Which of the following statements is not a step in Pre pruning?
9. Continuous Variable Decision tree has a categorical target variable.
10. Minimum number of objects pruning is a Post pruning technique.
11. Pruning a tree reduces it to a much smaller tree.
12. Consider the dataset given below where T and F represent True and False respectively. What is the entropy H (Rain)?
13. Given entropy of parent = 1, weights averages = (\(\frac {3}{4}, \, \frac {1}{4}\)) and entropy of children = (9, 0). What is the information gain?
14. The value obtained by terminal nodes in the training data is the mean response of observation falling in that region.
15. Bagging and Boosting are two main ways for combining the outputs of multiple decision trees into a random forest.
16. Which of the following statements is not true about the Regression trees?
17. Which of the following statements is not true about Random forests?
18. Which of the following statements is not true about the ID3 algorithm?
19. Which of the following statements is not true about the Random forests?
20. Which of the following is expressed by the given equation Y = β0 + β1X + Ɛ which shows a real-valued dependent variable Y is modeled as function of a real-valued independent variable X plus noise?
21. Given the entropy for a split, Esplit = 0.39 and the entropy before the split, Ebefore = 1. What is the Information Gain for the split?
22. Pruning can only be performed by a bottom up walk on the decision tree.
23. Categorical Variable Decision tree has a categorical target variable.
24. Which of the following statements is not an objective of Information Gain?
25. Real valued features problems in decision trees cannot be solved using ID3 algorithm.