Question

In: Computer Science

Optimization PS(3) Problem: Given a set of n program and three storage devices. Let si be...

Optimization PS(3) Problem:

Given a set of n program and three storage devices.

Let s_i be the amount of storage needed to store the i^th program. Let L be the storage capacity of each disk. Determine the maximum number of these n programs that can be stores on the three disks (without splitting a program over the disks).

Use the Approximation PS Algorithm given in the class for the PS(3) problem given above. Show that the following is true.

Let the approximation PS algorithm returns a number C, and let C^* be the optimal (maximum) number of programs that can be stores on the three disks.

(a) Show that the above approximation PS algorithm gives the performance ratio of C^* <= (C + 2) OR (C^* / C) <= (1 + 2 / C)

(b) Give an example that achieves the performance ratio of C^* = (C + 2).

Expert Solution

Answer:

Note: It is calculated by the standard PS algorithm

Given:

Given data states the program is storing AT MOST 2 program lesser than the optimal solution

The PS algorithm approximation returning the C number

where the optimal value is C*

It is very obvious for showing the and L such that C*=(C+2)

Consider the 3 disk with capacity 6L

Hence the maximum number of programs can be stored into the disk and that can be considered as,

it states the is the MAXIMUM number of PROGRAMS that is stored in the disk

j is considered as the index value

It states that and program j are accumulated in the first disk by applying approximation algorithm

By applying the equation ''i'' and ''íi''

At least the

venereology answered 1 year ago

3. For a solar cell, n-Si is given to have a refractive index of 3.435. The...

3. For a solar cell, n-Si is given to have a refractive index of 3.435. The average power incident (Pin) is 92.5 mW/cm2. (a). Evaluate the surface reflection loss of the silicon solar cell. (b). Design an antireflection coating to eliminate the loss for light with 0.64 μm wavelength (provide index and thickness of this coating).

7. Let n ∈ N with n > 1 and let P be the set of...

7. Let n ∈ N with n > 1 and let P be the set of polynomials with coefficients in R. (a) We define a relation, T, on P as follows: Let f, g ∈ P. Then we say f T g if f −g = c for some c ∈ R. Show that T is an equivalence relation on P. (b) Let R be the set of equivalence classes of P and let F : R → P be...

Let S be a set of n numbers. Let X be the set of all subsets...

Let S be a set of n numbers. Let X be the set of all subsets of S of size k, and let Y be the set of all ordered k-tuples (s1, s2, , sk) such that s1 < s2 < < sk. That is, X = {{s1, s2, , sk} | si S and all si's are distinct}, and Y = {(s1, s2, , sk) | si S and s1 < s2 < < sk}. (a) Define a one-to-one correspondence f : X → Y. Explain...

3. We let ??(?) denote the set of all polynomials of degree at most n with...

3. We let ??(?) denote the set of all polynomials of degree at most n with real coefficients. Let ? = {? + ??3 |?, ? ??? ???? ???????}. Prove that T is a vector space using standard addition and scalar multiplication of polynomials in ?3(?).

Let “ ·n” be multiplication modulo n, and consider the set Un = { [a] ∈...

Let “ ·n” be multiplication modulo n, and consider the set Un = { [a] ∈ Zn | there is a [b] ∈ Zn with [a] ·n [b] = [1]} (a) Show that (Un, ·n ) is a group. (b) Write down the Cayley table for U5. Hint: |U5| = 4. (c) Write down the Cayley table for U12. Hint: |U12| = 4.

c) Let R be any ring and let ??(?) be the set of all n by...

c) Let R be any ring and let ??(?) be the set of all n by n matrices. Show that ??(?) is a ring with identity under standard rules for adding and multiplying matrices. Under what conditions is ??(?) commutative?

Let A be a set with m elements and B a set of n elements, where...

Let A be a set with m elements and B a set of n elements, where m; n are positive integers. Find the number of one-to-one functions from A to B.

Problem 5 Given a table of n integers and an integer k, make a program in...

Problem 5 Given a table of n integers and an integer k, make a program in C++ that: a) Read n b) Read the table of numbers. c) Determine the number of elements in the table less than k d) Determine the number of elements in the table equal to k e) Determine the number of elements in the table greater than k f) That displays the values found

The subset-sum problem is defined as follows. Given a set of n positive integers, S =...

The subset-sum problem is defined as follows. Given a set of n positive integers, S = {a1, a2, a3, ..., an} and positive integer W, is there a subset of S whose elements sum to W? Design a dynamic program to solve the problem. (Hint: uses a 2-dimensional Boolean array X, with n rows and W+1 columns, i.e., X[i, j] = 1,1 <= i <= n, 0 <= j <= W, if and only if there is a subset of...

Suppose the optimization problem is to minimize the cost of production c = 3 x +...

Suppose the optimization problem is to minimize the cost of production c = 3 x + 4 y subject to the constraint 2xy =337.5. Here the cost-minimizing amount of x is ?? , and y is ?? . The Lagrange multiplier is ?? . The second principal minor of Bordered Hessian is ?? . The bordered Hessian matrix is??