Answer:
Its 6
Step-by-step explanation:
We have a "rectangular" double loop, meaning that both loops go to completion.
So there are 3*4=12 executions of t:=t+ij.
Assuming two operatiions per execution of the innermost loop, (i.e. ignoring the implied additions in increment of subscripts), we have 12*2=24 operations in all.
Here the number of operations (+ or *) is exactly known (=24).
Big-O estimates are used for cases with a varying scale of operations, governed by a variable (usually n) to indicate the sensitivity of the number of operations relative to a change in the size of n.
Here we do not have a scale, nor n is defined. The number of operations is constant and known at 24. So a variable is required to find the big-O estimate.
Answer:
In standard form it is x^4 - 12x^3y + 54x^2y^2 - 108x y^3 + 81y^4.
Step-by-step explanation:
(3y)^4 + 4C1(3y)^3(-x) + 4C2(3y)^2(-x)^2 + 4C3(3y)(-x)^3 + (-x)^4
= 81y^4 - 108y^3x + 54y^2x^2 - 12yx^3 + x^4
Answer:
34 - 31i
Step-by-step explanation:
first, distribute to get 40 - 16i - 15i + 6i^2. i^2 = -1 so 6(-1) is -6. simplify to get 34 -31i
