show that in the general case, exact recovery of a linear compression scheme is impossible.

1. Given some number k, let k-Richness be the following requirement: For any finite X and every partition C = (C1, . . .Ck of X (into nonempty subsets) there exists some dissimilarity function d over X such that F(X,d) = C.

Prove that, for every number k, there exists a clustering function that satisfies the three properties: Scale Invariance, k-Richness, and Consistency.

2. In this exercise we show that in the general case, exact recovery of a linear compression scheme is impossible.

3. let ∈Rn,be an arbitrary compression matrix where d−1. Show that there exists u,v ∈ Rn, u _= v such that Au = Av.

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