Answer:
1. 332
2. 177
Step-by-step explanation:
Answer:
A₍ₙ₎ = - 74 + (n-1) x 6
Step-by-step explanation:
A₍ₙ₎ = A₍₁₎ + (n-1) x d
A₍₁₈₎ = 28 = A₍₁₎ + 17 x d ..... (1)
A₍₄₀₎ = 160 = A₍₁₎ + 39 x d .....(2)
(2)-(1) 132 = 22d
d = 6
A₍₁₎ = 28 - 17 x 6 = -74
formula: A₍ₙ₎ = - 74 + (n-1) x 6
<span>3y-6x=9
</span><span>3y = 6x + 9
y = 2x + 3
answer
</span> y = 2x + 3
Answer:
The minimum number of assignment statements needed is 5
Step-by-step explanation:
To write the algorithm, we apply the strategy of interchanging the values of variables in the assignment statements.
Assume "tmp" is the new variable, let assign tmp to w
The algorithm is:
Procedure exchange (w,x,y,z: integers)
tmp := w
w := x
x := y
y := z
z := tmp
return (w,x,y,z)
end
From the algorithm, it is obvious that there will be a minimum of 5 assignment statements needed.
