SB CSE 675
Fall 2000
Program Transformation and Program Analysis
Annie Liu
Solution 8
Handout S8
Nov. 22, 2000

Problem 1.

a. {a[i+j]: 0<=j<=9}

b. i'=i+1

c. {a[i]} and {a[i+10]}

d. b[i+1] := b[i] - a[i] + a[i+10];

e.

   b[1] := 0;
   for j: = 0 to 9 do
     b[1] := b[1] + a[1+j];
   for i: = 2 to n-9 do
     b[i] := b[i-1] - a[i-1] + a[i+9];

Problem 2.

m := a[1];
m1 := 0;
for i := 1 to n do
  m1 := min(m1 + a[i], a[i]);
  m : = min(m, m1);