wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

ITS665_Chap4

Total questions: 20

Worksheet time: 10mins

Name
Class
Date
1.

Which of the following is a characteristic of supervised learning?

a)

Does not require training data

b)

Focuses on clustering

c)

Involves labeled data

d)

Uses unlabeled data

2.

What is the purpose of attribute selection in Decision Trees?

a)

To visualize the data

b)

To classify data into clusters

c)

To determine the best splitting attribute

d)

To reduce the size of the dataset

3.

Which algorithm is commonly used for Decision Tree induction?

a)

Support Vector Machines

b)

Apriori

c)

Hunt's Algorithm

d)

K-means

4.

Which of the following is an example of unsupervised learning?

a)

Naïve Bayes

b)

Logistic Regression

c)

K-means Clustering

d)

Decision Trees

5.

What is the formula for calculating accuracy in classification?

a)

Correct samples / Total samples

b)

Total samples / Correct samples

c)

Correct samples + Total samples

d)

Total samples - Correct samples

6.

What type of data does supervised learning use?

a)

Structured data

b)

Random data

c)

Labeled data

d)

Unlabeled data

7.

Which of the following is a continuous attribute?

a)

Marital Status

b)

Class

c)

Refund

d)

Taxable Income

8.

What does a Decision Tree model output?

a)

A set of rules

b)

A single value

c)

A graph

d)

A list of attributes

9.

What is the primary goal of classification in data mining?

a)

Group similar items

b)
  • Predict class labels accurately

c)

Visualize data

d)

Normalize data

10.

Which algorithm is NOT associated with supervised learning?

a)

Decision Tree

b)

K-Means

c)

K-Means

d)

Naïve Bayes

11.

In a decision tree, what does each leaf node represent?

a)

An attribute

b)

A decision

c)

A class label

d)

A class label

12.

What is used to measure the impurity of a node in a decision tree?

a)

Accuracy

b)

Entropy

c)

Precision

d)

Recall

13.

A decision tree’s root node is based on which attribute selection?

a)

Random

b)

Information Gain

c)

Gini Index

d)

Gain Ratio

14.

What is the output of a decision tree algorithm?

a)

Association rules

b)

A tree structure

c)

A regression equation

d)

Clusters

15.

What type of data is suitable for unsupervised learning?

a)

Labeled data

b)

Unlabeled data

c)

Both labeled and unlabeled data

d)

None of the above

16.

When do you stop splitting in a decision tree algorithm?

a)

All records belong to one class

b)

Max tree depth reached

c)

Attributes are exhausted

d)

All of the above

17.

What is the final outcome of applying a decision tree to test data?

a)

A report

b)
  • Predicted labels

c)

Clusters

d)

Association rules

18.

What is an advantage of rule extraction from decision trees?

a)

Complexity

b)

Clarity

c)

Generalization

d)

Randomness

19.

In binary splitting, how many subsets does a continuous attribute divide into?

a)

1

b)

2

c)

3

d)

4

20.

What does the term "overfitting" mean in a decision tree model?

a)
  • The model is too simple

b)

The model generalizes well

c)
  • The model fits noise in the training data

d)

The model is accurate