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:
Domain: (-∞, ∞)
Range: [0, ∞)
Step-by-step explanation:
The domain represents what x can be. In this scenario, we do not have x as a denominator, and there is nothing limiting x, so its domain is (-∞, ∞)
The range represents what f(x) can be, Because |x-4| is in absolute value, the lowest |x-4| can be is 0, and as a result, the lowest value of 2|x-4| is 2*0=0. The maximum value of f(x) is ∞ as an absolute value does not limit the maximum, making the range [0, ∞)
The initial number of trees is when t = 0:-
1500 * t^0 = 1500 so the answer is either a or c.
The value 1.02 represents a 2% increase so the answer is Option c.
Answer:
y=3x-1 and y=3x+1
Step-by-step explanation:
y=mx+b form
m stands for the slope which is rise over run.
b stands for the y intercept. where the line intersects with the y axis.
