1. KNN algorithm does more computation on test time rather than train time.

2. Which of the following statement is true about k-NN algorithm? (can be more than 1 answer is true)

Which of the following distance metric can not be used in k-NN?

Which of the following will be Euclidean Distance between the two data point A(1,3) and B(2,3)?

In decision tree, the inner node represents a class

Which algorithm is using information gain as its splitting criteria?

Attribute which entropy has value 0 is purest.

Which of the following algorithm are not an example of ensemble learning algorithm?