Back to marketplace

Quiz 3

No description yet. This curated deck is ready for daily study.

Total cards: 19•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (19)

#1
Front (Question)

Decision trees are an algorithm for which machine learning task?

Back (Answer)

Classification

#2
Front (Question)

Root node

Back (Answer)

decision tree has no incoming edges and zero or more outgoing edges

#3
Front (Question)

Internal node

Back (Answer)

has more than one incoming edge and one or more outgoing edges

#4
Front (Question)

Terminal node

Back (Answer)

has exactly one incoming edge and no outgoing edge

#5
Front (Question)

Internal node

Back (Answer)

denotes a test on a feature

#6
Front (Question)

In classification, a model or classifier

Back (Answer)

constructed to predict class (categorical) labels

#7
Front (Question)

Homogeneous class distribution

Back (Answer)

preferred to determine the best split for decision trees

#8
Front (Question)

Methods to look at node Impurity

Back (Answer)

Gini Index Information Gain Gain Ratio Misclassification Error

#9
Front (Question)

What is the minimum and maximum value for entropy?

Back (Answer)

0,1

#10
Front (Question)

What is the minimum and maximum value of GINI?

Back (Answer)

0,0.5

#11
Front (Question)

What is the minimum and maximum value for Misclassification Error?

Back (Answer)

0,0.5

#12
Front (Question)

The process of building a decision tree is recursive. It is built one node at a time and the algorithm is applied at each node the same way.

Back (Answer)

True

#13
Front (Question)

During the process of building a decision tree, at each node, the algorithm decides which attribute to use for a new split based on some criteria evaluated for each possible attribute.

Back (Answer)

True

#14
Front (Question)

During the process of building a decision tree, at each node, we consider the similarities between all the points and take the most similar ones to create the next nodes based on a criteria evaluated at each similar group of data.

Back (Answer)

False

#15
Front (Question)

What are splitting criteria used in decision trees?

Back (Answer)

GINI index Information Gain - Entropy Misclassification Error Gain Ratio

#16
Front (Question)

Building a tree that is too large or complex can cause

Back (Answer)

overfitting

#17
Front (Question)

To reduce the size of a tree after it is built, use an algorithm for

Back (Answer)

pruning

#18
Front (Question)

A decision tree tells how to classify instances. It can be turned into a list of rules. Which of the following are true?

Back (Answer)

Each leaf node gets turned into one rule Each internal node after the root gets added to the rule as an and condition

#19
Front (Question)

Overfitting in Machine Learning is defined as when a statistical model describes random error or noise instead of underlying relationship or when a model is excessively complex.

Back (Answer)

True