Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Intro to ML: Decision Trees

Total questions: 7

Worksheet time: 7mins

Name
Class
Date
1.

Which system requires more entropy to be described?

a)

Tossing a fair coin

b)

Tossing a biased coin

2.

Is it possible to test the same attribute twice along the same path on a decision tree for a categorical problem?

a)

Yes

b)

No

3.

Is it possible that the same attribute will get selected twice in an ordinal or real-valued problem?

a)

Yes

b)

No

4.

Decision trees are an algorithm for which machine learning task?

a)

Clustering

b)

Classification

c)

Classification and Regression

d)

Dimensionality reduction

e)

Regression

5.

When a tree is significantly deep, what does it indicate?

a)

The samples have a large number of attributes

b)

The dataset is possibly noisy

c)

The tree under-fits the training data

d)

None of these

6.

Which of the following is true:

a)

Deeper trees will always improve performance on the training data

b)

Deeper trees will always improve performance when testing the model on unseen data

c)

If a deeper tree improves performance on the training data, then it will also improve performance on new unseen data

7.

For a binary classification problem with a balanced dataset, if one feature completely determines the class for each observation, what is the information gain from using this feature as the first node in a tree?

a)

0

b)

0.5

c)

1

d)

Not enough information