Home > Consumer Behavior 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. Consider we have a set of data with 3 classes, and we have observed 20 examples of which the greatest number 15 is in class c. If we predict that all future examples will be in class c, what is the expected error rate without pruning?
2. 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?
3. Minimum number of objects pruning is a Post pruning technique.
4. Which of the following statements is not true about Information Gain?
5. Which of the following statements is not true about the Inductive bias in the decision tree?
6. Which of the following statements is not true about Random forests?
7. Practical decision tree learning algorithms are based on heuristics.
8. Continuous Variable Decision tree has a categorical target variable.
9. Which of the following statements is true about Candidate elimination?
10. Which of the following statements are not true about the Classification trees?
11. Splitting is the process of dividing a node into two or more sub-nodes.
12. Which of the following statements is not true about the Decision tree?
13. Inductive bias is also known as learning bias.
14. Which of the following statements is not true about the Regression trees?
15. 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?
16. Regression trees follow a top down greedy approach.
17. Categorical Variable Decision tree has a categorical target variable.
18. Consider we have a set of data with 3 classes, and we have observed 20 examples of which the greatest number 15 is in class c. If we predict that all future examples will be in class c, what is the expected error rate using minimum error pruning?
19. 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?
20. Which of the following statements is not true about Decision trees?
21. Which of the following statements is not true about the Random forests?
22. Which of the following statements is not true about Information Gain?
23. Real valued features problems in decision trees cannot be solved using ID3 algorithm.
24. 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?
25. Which of the following statements are not true about Inductive bias in ID3?