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. Inductive bias is also known as learning bias.
2. Minimum number of objects pruning is a Post pruning technique.
3. Pruning a tree reduces it to a much smaller tree.
4. 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?
5. Which of the following statements is not true about the Decision tree?
6. Splitting is the process of dividing a node into two or more sub-nodes.
7. Which of the following statements is not true about Reduced error pruning?
8. Which of the following statements is not true about the pruning in the decision tree?
9. Pre pruning is also known as online pruning.
10. Which of the following statements is not true about Pruning?
11. Which of the following statements is not an advantage of Reduced error pruning?
12. Which of the following statements is not true about Information Gain?
13. Which of the following statements is not true about Information Gain?
14. Suppose in a decision tree, we are making some simplifying assumptions that each instance is a vector of d bits (X = {0, 1}d). Which of the following statements is not true about the above situation?
15. Which of the following statements are not true about Inductive bias in ID3?
16. Which of the following statements is not true about a splitting rule at internal nodes of the tree based on thresholding the value of a single feature?
17. Which of the following is not a Decision tree algorithm?
18. Consider the example, number of corrected mis – classifications at a particular node, n'(t) = 15.5, and number of corrected mis – classifications for sub – tree, n'(Tt) = 12. N(t) is the number of training set examples at node t and it is equal to 35. Here the tree should be pruned.
19. Minimum error pruning is a Top down approach.
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. In the ID3 algorithm the returned tree will usually be very large.
22. Which of the following is expressed by the given equation Y = β0 + βTX + Ɛ which shows a real-valued dependent variable Y is modeled as function of multiple independent variables X1, X2, …, Xp ≡ X plus noise?
23. Given entropy of parent = 1, weights averages = (\(\frac {3}{4}, \, \frac {1}{4}\)) and entropy of children = (9, 0). What is the information gain?
24. Which of the following statements is not true about the Regression trees?
25. Given the table which shows the abstract details of players who play a particular game on various days according to the weather conditions. The standard deviation of players is 6.58. What is the Standard deviation reduction for Temperature?