Prove the following inequalities Gk−diam((X,d), (ˆC1, . . ., ˆCk )) ≤ 2r Gk−diam((X,d), (C∗ 1 , . . .,C∗ k )) ≥r .

1. Given a metric space (X,d), where |X<>∞, and ∈ N, we would like to find a partition of into C1, . . .,Ck which minimizes the expression Gk−diam((X,d)(C1, . . .,Ck )) = max j∈[d] diam(Cj )where diam(Cj ) = maxx,xCj d(xx_) (we use the convention diam(Cj ) = 0 if |Cj <>2).

Similarly to the k-means objective, it is NP-hard to minimize the k-diam objective. Fortunately, we have a very simple approximation algorithm: Initially, we pick some ∈ and set μ1 = x. Then, the algorithm iteratively sets ∀ ∈ {2,

Hint: Consider the point μk+1 (in other words, the next center we would have chosen, if we wanted +1 clusters). Let = minj∈[kd(μjk+1). Prove the following inequalities Gk−diam((X,d)C1, . . ., ˆCk )) ≤ 2r Gk−diam((X,d)(C∗ 1 , . . .,C∗ )) ≥.


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