Practice Advanced Counting Mechanisms (2.3) - Fundamentals 47 - Discrete Mathematics

Practise this section

8 questions

Flashcard drill
2 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
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
Define a recurrence relation for the sequence where each term is the sum of the previous two.
Show hintHide hint
Think of a sequence like Fibonacci.
Question 2.
What is the base case for a recurrence relation?
Show hintHide hint
Look for the starting value of the sequence.
3Question 3.
What is a recurrence relation?
- A sequence defined with initial values
- An equation defining a sequence recursively
- A method for linear equations
Show hintHide hint
Recurrence often involves sequences, think of Fibonacci.
4Question 4.
True or False: Recurrence relations are not used in programming.
- True
- False
Show hintHide hint
Think of recursion and dynamic programming.
Question 5.
Find the closed-form solution for the recurrence relation a_n = 3a_{n-1} - 2, a_1 = 2.
Show hintHide hint
Consider iterating the first few terms.
Question 6.
Discuss how recurrence relations could optimize a recursive function for calculating factorial.
Show hintHide hint
Look at storing values of the factorial calculation.

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