modify the Perceptron algorithm as follows

1. Suppose we modify the Perceptron algorithm as follows: In the update step, instead of performing w(t+1) =w(t)+yixwhenever wemake a mistake, we perform w(t+1) = w(t) + ηyixfor some η > 0. Prove that the modified Perceptron will perform the same number of iterations as the vanilla Perceptron and will converge to a vector that points to the same direction as the output of the vanilla Perceptron.

2. In this problem, we will get bounds on the VC-dimension of the class of (closed) balls in Rd, that is, Bd = {Bv,: v ∈ R,0}, where Bv,(x) = * 1 if              x−v         ≤r 0 otherwise .

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