Suppose in a distributed system R = {r1, r2, · · · , rk} processes are distributed over a linear array of N processors. The data is stored on a disk at the N + 1st processor. For every process there is cost Cp(j) of running process p on j. And a communication cost Dp(j) of getting data for the process p. Suppose the processes are to be scheduled with the restriction that if ri , rj , j ≥ i is assigned to processor qk and ql , respectively, then l ≥ k. Design and analyze an algorithm to minimize the total cost.

hello from mrbilldoesmath!

answer:

(7 x + 6 y) (49 x^2 - 42 x y + 36 y^2)

discussion:

the trick is to recognize that 343 = 7^3 and 216 = 6^3 and, in general,

a^3 + b^3 =   (a + b) (a^2 - a b + b^2).

in our case

343x^3+216y^3   =   (7x)^3 + (6y)^3

so take a = 7x and b = 6y in the above equation to get the answer.

you,

mrb

d no solution

step-by-step explanation:

to complete this square you have to rotate about the origin 270 degrees clockwise.

hello,

as we don't know if g(x) is continue,

answer b

f(x)=2x²-8x+1=2(x²-4x+4)+1-8=2(x-2)²-7

vertex is (2,-7) ( a minimum since coefficient of x² is > 0)