Practice Counting Using Recurrence Equations (13) - Counting Using Recurrence Equations

Practise this section

10 questions

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

6 sample questions

Question 1.
Define a recurrence equation.
Show hintHide hint
Think about how you can express one term through others.
Question 2.
What is A(1) for bit strings not containing consecutive zeros?
Show hintHide hint
Consider the possible 1-bit strings.
3Question 3.
What is a recurrence equation?
- A function of previous outputs
- A linear equation
- An iterative formula
Show hintHide hint
Think of its role in sequences.
4Question 4.
True or False: The Fibonacci sequence is an example of a recurrence relation.
- True
- False
Show hintHide hint
Consider how Fibonacci numbers relate.
Question 5.
Consider an application where you are counting paths in a grid that do not retrace steps. How would you set up a recurrence relation?
Show hintHide hint
Consider possible moves at each grid point.
Question 6.
Propose a unique challenge problem involving recurrence relations that is applicable in computer algorithms.
Show hintHide hint
Explore how to build trees based on left and right nodes.

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