Data Structure, Recursive functions

Question

I have tried several times to find the answer of this question and every time my result is 30 but the answer key shows the result to 32 and I don't understand why it should be 32??!! it is a data structure question related to recursive functions;

Let function F be defined recursively as follows: F(0) = 3; F(n + 1) = 2F(n) + n^2 Then F(3) is given by?

Please edit the question to show your work for evaluating F(3). Also, welcome to SO and please read tour and How to Ask. — Dave S
– Dave S, Commented Mar 18, 2018 at 20:49

Óscar López · Accepted Answer · 2018-03-18 20:57:14Z

2

This is not a data structures question. If we implement the function in, say, Python:

def f(n):
    if n == 0:
        return 3
    else:
        return 2 * f(n-1) + (n-1)**2

We get this:

f(3)
=> 30

So it seems to me that the answer key is mistaken.

edited Mar 18, 2018 at 20:57

answered Mar 18, 2018 at 20:50

Óscar López

237k38 gold badges321 silver badges391 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Data Structure, Recursive functions

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related