Q10. Consider the following algorithm:
1 answer:
Answer:
61,940
Step-by-step explanation:
For a recursive sequence of reasonable length, it is convenient to use a suitable calculator for figuring the terms of it. Since each term not only depends on previous terms, but also depends on the term number, it works well to use a spreadsheet for doing the calculations. The formula is easily entered and replicated for as many terms as may be required.
__
The result of executing the given algorithm is shown in the attachment. (We have assumed that g_1 means g[-1], and that g_2 means g[-2]. These are the starting values required to compute g[0] when k=0.
That calculation looks like ...
g[0] = (0 -1)×g[-1] +g[-2} = (-1)(9) +5 = -4
The attachment shows the last term (for k=8) is 61,940.
You might be interested in
Option a: is the length of b
Explanation:
The angle of B is and
We need to determine the length of b.
First, let us determine the angle of A.
Since, ABC is a triangle, then all the angles add up to 180°
Thus, we have,
Thus, the angle of A is
Now, we shall determine the length of b using the sine law formula.
The formula for sine law is given by,
where ,
,
Thus, we have,
Simplifying, we get,
Multiplying both sides by 0.866, we get,
Multiplying the numerator, we have,
Dividing, we get,
Thus, the length of b is
Hence, Option a is the correct answer.