Recursive Functions

Recursive Functions

Recursive Functions :)

Multiple Choice

What is the 10th number in the fibonacci series starting from 0, 1?

If you don't know, guess.

• 13

• 21

• 34

• 55

The ​Fibonacci Series

​The Fibonacci series continues by adding the last two numbers together and continuing on.

​

It starts with 0 and 1 (or 1 and 1, depending on how you like it)​

​

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55...

Fibonacci series

​Fibonacci Function

The function

Multiple Choice

This is the factorial function.

$$f\left(0\right)\ =\ 1$$  

$$f\left(n\right)\ =\ f\left(n\ -\ 1\right)\ \cdot\ n$$     $$if\ n\ >\ 0$$  

Calculate $$f\left(6\right)$$  

• 72

• 120

• 64

• 720

• 640

​How to Solve

Some text here about the topic of discussion

Multiple Choice

$$h\left(x\right)=h\left(x\ -\ 7\right)\ +\ 1$$   $$if\ x\ >\ 5$$  

$$h\left(x\right)\ =\ x$$   $$if\ 0\le x\le5$$  

$$h\left(x\right)\ =\ h\left(x\ +\ 3\right)$$   $$if\ x\ <\ 0$$  

What is $$h\left(13\right)?$$  

• 4

• 3

• 2

• 1

Open Ended

If x is odd, f(x) = f(3x + 1)

If x is even, f(x) = f(x / 2)

What is this famous sequence called (it has 7 letters in its name)?

Multiple Choice

$$f\left(x,\ y\right)\ =\ f\left(x\ -\ y,\ y\ -\ 1\right)+2$$   $$if\ x\ >\ y$$  

$$f\left(x,\ y\right)\ =\ x\ +\ y$$   $$otherwise$$  

Find $$f\left(12,\ 6\right)$$  

• 17

• 9

• 5

• 13

Multiple Choice

• 11

• -9

• -3

• 7

• 1001₂