Prove that with probability of at least 1− δ over a choice of a random matrix W ∈ Rn,d , where each element of W is independently distributed according to N(0,1/n), we have |_Wu,Wv_−_u,v_| ≤ _ for every u,v ∈ Q.

1. The Relation between SVD and PCA: Use the SVD theorem (Corollary C.6) for providing an alternative proof of Theorem 23.2.

2. Random Projections Preserve Inner Products: The Johnson-Lindenstrauss lemma tells us that a random projection preserves distances between a finite set of vectors. In this exercise you need to prove that if the set of vectors are within the unit ball, then not only are the distances between any two vectors preserved, but the inner product is also preserved. Let be a finite set of vectors in Rand assume that for every x ∈ we havex  ≤ 1.

1. Let δ ∈ (01) and n be an integer such that = + 6log(|Q|2≤ 3.

Prove that with probability of at least 1− δ over a choice of a random matrix ∈ Rn,, where each element of is independently distributed according to N(0,1/n), we have |_Wu,Wv_−_u,v_| ≤ _ for every u,v ∈ Q.

Hint: Use JL to bound both          W(u+v) u+v        and       W(u−v) u−v

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