# Question: Draw a decision tree for the problem of deciding whether

Draw a decision tree for the problem of deciding whether to move forward at a road intersection, given that the light has just turned green.

## Answer to relevant Questions

We never test the same attribute twice along one path in a decision tree. Why not?Suppose that a learning algorithm is trying to find a consistent hypothesis when the classifications of examples are actually random. There are u Boolean attributes, and examples are drawn uniformly from the set of 2n ...Fill in the missing values for the clauses C1 or C2 (or both) in the following sets of clauses, given that C is the re solvent of C1 and C2: a. C = True → P (A, B), C1 = P (x, y) → Q(x, y), C2 =?? b. C = True ...Consider m data points (x j, y j), where the y j s are generated from the x j s according to the linear Gaussian model in Equation (20.5). Find the values of θ1, θ2 and σ that maximize the conditional log ...Consider the following set of examples, each with six inputs and one target output:a. Run the perception learning rule on these data and show the final weights.b. Run the decision tree learning rule, and show the resulting ...Post your question