Practice Fibonacci Numbers (24.2.2) - Module – 02 - Design & Analysis of Algorithms

Practise this section

9 questions

Flashcard drill
3 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Define Fibonacci numbers in your own words.
Show hintHide hint
Think about the starting numbers.
Question 2.
What is Fibonacci(3)?
Show hintHide hint
Calculate using previous Fibonacci numbers.
3Question 3.
What are the first two Fibonacci numbers?
- 0
- 1
- 1
- 1
- 0
- 0
Show hintHide hint
Remember the starting values.
4Question 4.
True or False: Fibonacci(5) equals Fibonacci(4) plus Fibonacci(3).
- True
- False
Show hintHide hint
Think about the definition.
Question 5.
Using memoization, implement a function to calculate Fibonacci numbers and compare its performance against a naive recursive implementation.
Show hintHide hint
Time each approach and compare.
Question 6.
Design a dynamic programming solution for calculating Fibonacci numbers and explain why it is efficient.
Show hintHide hint
Explain the fill-up process in your solution.

5 more questions in this section. Enroll free to practise them all.