Register

GO Classes DPP | ML |DECISION TREE

218 views

1 Answer

1 1 vote

Look at all paths from the root to the leaves. Find the shortest and longest path.

$\operatorname{Min}=2, \max =4$

Hence, B and D are correct

Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes DPP | ML ...Next → · GO Classes DPP | ML ...
← Previous in category · GO Classes DPP | ML ...Next in category → · GO Classes DPP | ML ...
Position:
Show:

Related questions

0 0 votes
1 1 answer
273
273 views
GO Classes asked Oct 1, 2025
273 views
GO Classes DPP | ML |DECISION TREE
If the algorithm is terminated at this level, then what are the labels associated with L1 and L2?L1: $0$ L1: $1$ L2: $0$ L2: $1$
0 0 votes
1 1 answer
296
296 views
GO Classes asked Oct 1, 2025
296 views
GO Classes DPP | ML |DECISION TREE
$p$ is the proportion of points with label $1$ in some node in a decision tree. Which of the following statements is/are true?As the value of $p$ increases from $0$ to $1...
1 1 vote
1 1 answer
398
398 views
GO Classes asked Oct 1, 2025
398 views
GO Classes DPP | ML |DECISION TREE
What is the information gain for this split? Report your answer correct to three decimal places.
0 0 votes
1 1 answer
316
316 views
GO Classes asked Oct 1, 2025
316 views
GO Classes DPP | ML |DECISION TREE
  What is the impurity in L1 if we use entropy as a measure of impurity? Report your answer correct to three decimal places.