Use the provided decision tree to predict the label for each of the provided samples . This time we consider 4 classes (.

Remember: following the left branch corresponds to , and the right branch to .

Consider feature X0 and the label y in the given table. Select all possible split points!

Translate the following sentence to CNF:

Which of the following truth assignments produces output 1 for ? Select all that apply.

Assume you are using a different algorithm than the ID3 algorithm for creating a decision tree for the dataset shown in the graph. It randomly picks 4 possible split points, and then determines the best one out of those four (according to the information gain). 

Which splitting point would it pick, given that the algorithm can choose between the following 4 possible split points?

The Monte Carlo Tree Search (MCTS) algorithm needs to select the next node to explore from the parent node. 

Hint: Use the simple approximation for your calculation.

Given this game tree, let us apply Alpha-Beta pruning.

Nodes are checked from left to right (as was defined in the lecture).

If the value of β at the root node is 3 after searching the subtree of the highlighted MAX node (A21 and A22), what utility value(s) could a have? Select all that apply

You are given the following MCTS tree.