Home
Evaluations
Tags
Lectures
Sandbox
About
Contribute
Evaluations
Tags
Lectures
About
Back
Question:
2014 Winter Final - 10
Author: Michiel Smid
Consider the following recursive function:
$f(0)$
$\;=\;$
$3,$
$f(n + 1)$
$\;=\;$
$f(n) + 10n + 2\; \ \text{for all}$ $\text{integers}\ n \geq 0.$
Which of the following is true?
(a)
for all $n \geq 0$: $f(n) = 5n^{2} - 3n + 2$
(b)
for all $n \geq 0$: $f(n) = 5n^{2} - 2n + 3$
(c)
for all $n \geq 0$: $f(n) = 5n^{2} - 3n + 3$
(d)
for all $n \geq 0$: $f(n) = 5n^{2} + 3n + 3$
COMP 2804: Discrete Structures II
COMP 2804 Final Exam
Recursive Functions (4.1)