Prove that the function h given in Equation (10.5) equals the piece-wise constant function defined according to the same thresholds as h

1. Prove that the function given in Equation (10.5) equals the piece-wise constant function defined according to the same thresholds as h.

2. We have informally argued that the AdaBoost algorithm uses the weighting mechanism to “force” the weak learner to focus on the problematic examples in the next iteration. In this question we will find some rigorous justification for this argument. Show that the error of ht w.r.t. the distribution D(t+1) is exactly 1/2. That is, show that for every ∈ [] _m i=1 D(t+1) 1[yi _=ht (x)] = 1/2.

3. In this exercise we discuss the VC-dimension of classes of the form L(B,T). We proved an upper bound of O(dT log(dT)), where = VCdim(B). Here we wish to prove an almost matching lower bound. However, that will not be the case for all classes B.

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….