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
<u>In Bar Graphs;</u>
- Bars have equal space
- One the y-axis, we have numbers & on the x-axis, we have data which can be anything.
<u> In Histograms;</u>
- Bars are fixed
- On the y-axis, we have numbers & and on the x-axis, we have data which in continuous & will always be number.
<u>An easy way you can remember the difference is looking at the spaces of the bars. </u>
<em>A bar graph has gaps</em>
<em>A histogram has no gaps.</em>
Answer:
$1170
Step-by-step explanation:
Let the sells for economy seats be =x
Let the sells for deluxe seats be=y
The inequalities that can be obtained are;
x≥1 --------------------at least 1 economy seats
y≥6 --------------------at least 6 deluxe seats
x+y=30-----------------maximum number of passengers allowed on each boat
Graph the inequalities
Use the graph tool to locate the point of maximum profit.The intersecting point for the three graphs
The point is (24,6)
Hence, x=24 and y=6
Profit for each
Economy seats 24×$40=$960
Deluxe seats 6×$35=$210
Maximum profit for one tour
$960+$210=$1170
