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

Suppose a laboratory has a 30 g sample of polonium-210. the half-life of polonium-210 is about 138 days how many half-lives of polonium-210 occur in 1104 days? how much polonium is in the sample 1104 days later? 9; 0.06 g 8; 0.12 g 8; 2,070 g

When a valve is open 281 gallons of water go through it in one hour the number of gallons that would go through in 94 hours is

If p(x) is the total value of the production when there are x workers in a plant, then the average productivity of the workforce at the plant is a(x) = p(x) x . (a) find a'(x). a'(x) = xp'(x) − p(x) x a'(x) = xp'(x) − p(x) x2 a'(x) = p'(x) − p(x) x a'(x) = xp'(x) − p'(x) x2 a'(x) = p'(x) − xp(x) x2 why does the company want to hire more workers if a'(x) > 0? a'(x) > 0 ⇒ a(x) is ; that is, the average productivity as the size of the workforce increases. (b) if p'(x) is greater than the average productivity, which of the following must be true? p'(x) − xp(x) > 0 p'(x) − xp(x) < 0 xp'(x) − p'(x) > 0 xp'(x) − p(x) < 0 xp'(x) − p(x) > 0