Assignment 9
Q.1 Which of the following statements are correct about decision trees?
A. It requires normalization of data
B. It does not require normalization of data
C. Missing Value are not important
D. Decision tree does not need root node always
Ans-
B. It does not require normalization of data
C. Missing Value are not important
Q.2 Consider the following statements-
Statement 1: Naive Bayes assumes independence among predictors.
Statement 2: Naive Bayes can perform multi-class prediction.
Select correct option about following statements:
A. Both, statement 1 and 2 are correct
B. Statement 1 is correct and statement 2 is wrong
C. Statement 1 is wrong and statement 2 is correct
D. Both, statement 1 and 2 are wrong
Ans- A. Both, statement 1 and 2 are correct
Q.3 Consider data given in the following table.
Attendance in Passed in Exam
(%)
Yes No
40-60 2 3
61-70 2 1
71-80 1 0
Total 5 4
Apply Naive Bayes classifier formula and answer Que 3.1 & 3.2
Q. 3.1 What is the probability of student failing the exam if the attendance is 40-60
A. 3/5
B. 4/5
C. 2/5
D. 1/5
Ans: 3/5
Q. 3.2 What is the probability of student passing the exam if the attendance is 70-80
A. 1
B. 1/2
C. 2/3
D. 1/3
Ans: 1
Q. 4 When to stop further constructing a decision tree?
A. When there are no more conditions left
B. When all the conditions belong to one group
C. When most of the conditions are grouped leaving few ungrouped
D. When there are odd number of nodes remaining
Ans:
A. When there are no more conditions left
B. When all the conditions belong to one group
Q. 5 Why is the Naive Bayes classifier called ‘Naive’?
A. The classifier can solve only a very limited number of problems, under multiple conditions.
B. Its use is limited to the domains of Natural Language Processing and Learning Analytics.
C. It assumes that the features of input space are strongly independent.
D. It assumes that the features of input space are strongly dependent.
Ans- C. It assumes that the features of input space are strongly independent.
Q. 6 Decision tree is a non-linear classifier.
1. True
2. False
Ans: True
Q. 7 Overfitting and increase in the tree complexity can be overcome through the process called
as _________________.
a. Normalization
b. Branching
c. Pruning
d. Classification
Ans: c. Pruning
Q. 8 Which of the following is an advantage of Decision Tree algorithm?
A. It is an extremely fast algorithm
B. It is easily interpretable and explainable
C. It can be used for classification, clustering as well as regression analysis.
D. It can also be used for sequence mining
Ans- B. It is easily interpretable and explainable
Q. 9 Suppose you have given the following graph which shows the ROC curve for two different
classification algorithms such as Random Forest(blue), Logistic Regression(orange) and
KNN(green). Which of the following algorithms would you consider in your final model
building on the basis of performance?
a. Random Forest
b. Logistic Regression
c. KNN
d. None of the above
Ans: a. Random Forest
