Generalize the dynamic programming procedure given in Section 17.3 for solving the maximization problem given in the definition of ˆh in the SGD procedure for multiclass prediction.

1. Generalize the dynamic programming procedure given in Section 17.3 for solving the maximization problem given in the definition of ˆin the SGD procedure for multiclass prediction. You can assume that _(y_ ,y) = _rt =1 δ(yyt) for some arbitrary function δ.

2. Prove that Equation (17.7) holds.

3. Show that the two definitions of π as defined in Equation (17.12) and Equation (17.13) are indeed equivalent for all the multivariate performance measures.

4.. Show that any binary classifier : {0,1}_→{0,1} can be implemented as a decision tree of height at most +1, with internal nodes of the form (xi = 0?) for some ∈ {1, . . .,d}.

find the cost of your paper

Suggest a modification of the binary search algorithm that emulates this strategy for a list of names.

1. Suppose that a list contains the values 20 44 48 55 62 66 74 88 93 99 at index positions 0 through 9. Trace the values of the variables….

Explain why insertion sort works well on partially sorted lists.

1. Which configuration of data in a list causes the smallest number of exchanges in a selection sort? Which configuration of data causes the largest number of exchanges? 2. Explain….

Draw a class diagram that shows the relationships among the classes in this new version of the system

Jack decides to rework the banking system, which already includes the classes BankView, Bank, SavingsAccount, and RestrictedSavingsAccount. He wants to add another class for checking accounts. He sees that savings….