Generalised Fibonacci numbers

Generalised Fibonacci numbers is a DSA topic. In plain words you use it for a short Generalised Fibonacci numbers example in a short dry-run on paper. Don’t start with a slogan — start with that picture.

Smallest example: the smallest Generalised Fibonacci numbers example you can type. Type it, run it, and say what you see. If you can do that from memory, you know Generalised Fibonacci numbers.

From the example next to this theory: Generalised Fibonacci numbers — dP stores subproblem answers so you never recompute them.

Trap — only saying “Generalised Fibonacci numbers” with no example. Fix that before you talk about advanced DSA.

Viva: what is Generalised Fibonacci numbers? Then show the smallest Generalised Fibonacci numbers example you can type. Then name the trap.

Exam tip

What is Generalised Fibonacci numbers? Show this: the smallest Generalised Fibonacci numbers example you can type. Trap: only saying “Generalised Fibonacci numbers” with no example.

Example

def fib(n):
    dp = [0, 1] + [0] * max(0, n - 1)
    for i in range(2, n + 1):
        dp[i] = dp[i - 1] + dp[i - 2]
    return dp[n]

print(fib(10))

Generalised Fibonacci numbers — dP stores subproblem answers so you never recompute them.

Short notes

DefGeneralised Fibonacci numbers — a short Generalised Fibonacci numbers example in a short dry-run on paper.
Rulethe smallest Generalised Fibonacci numbers example you can type
Traponly saying “Generalised Fibonacci numbers” with no example
Usea short dry-run on paper

Generalised Fibonacci numbers

Smallest example: the smallest Generalised Fibonacci numbers example you can type. Type it, run it, and say what you see. If you can do that from memory, you know Generalised Fibonacci numbers.

From the example next to this theory: Generalised Fibonacci numbers — dP stores subproblem answers so you never recompute them.

Trap — only saying “Generalised Fibonacci numbers” with no example. Fix that before you talk about advanced DSA.

Viva: what is Generalised Fibonacci numbers? Then show the smallest Generalised Fibonacci numbers example you can type. Then name the trap.

Exam tip

What is Generalised Fibonacci numbers? Show this: the smallest Generalised Fibonacci numbers example you can type. Trap: only saying “Generalised Fibonacci numbers” with no example.

Example

def fib(n):
    dp = [0, 1] + [0] * max(0, n - 1)
    for i in range(2, n + 1):
        dp[i] = dp[i - 1] + dp[i - 2]
    return dp[n]

print(fib(10))

Generalised Fibonacci numbers — dP stores subproblem answers so you never recompute them.

Short notes

DefGeneralised Fibonacci numbers — a short Generalised Fibonacci numbers example in a short dry-run on paper.
Rulethe smallest Generalised Fibonacci numbers example you can type
Traponly saying “Generalised Fibonacci numbers” with no example
Usea short dry-run on paper

Generalised Fibonacci numbers

Example

Short notes

Questions

Generalised Fibonacci numbers

Example

Short notes

Questions